Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

8

LOGCOM
2010

favoriteEmaildiscussreport

135views more LOGCOM 2010»

Bases of Admissible Rules of Lukasiewicz Logic

13 years 3 months ago

Bases of Admissible Rules of Lukasiewicz Logic

Download www.math.cas.cz

We construct explicit bases of single-conclusion and multiple-conclusion admissible rules of propositional Lukasiewicz logic, and we prove that every formula has an admissibly saturated approximation. We also show that Lukasiewicz logic has no ﬁnite basis of admissible rules.

Emil Jerábek

Real-time Traffic

Admissible Rules | LOGCOM 2010 | Lukasiewicz Logic | Propositional Lukasiewicz Logic |

claim paper

Related Content

» Admissible Rules of Lukasiewicz Logic

» Independent Bases of Admissible Rules

» A Tableau Method for Checking Rule Admissibility in S4

» Atomic Cut Elimination for classical Logic

» Towards StructurallyFree Theorem Proving

» Exploiting Inference Rules to Compute Lower Bounds for MAXSAT Solving

» Reasoning About Communication A Practical Approach Based on Empirical Semantics

» OperationalInterpretive Unfolding of Multiadjoint Logic Programs

Post Info
More Details (n/a)

Added	29 Jan 2011
Updated	29 Jan 2011
Type	Journal
Year	2010
Where	LOGCOM
Authors	Emil Jerábek

Comments (0)