Sciweavers

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

11

CIE
2008
Springer

favoriteEmaildiscussreport

129views Applied Computing» more CIE 2008»

Herbrand Theorems and Skolemization for Prenex Fuzzy Logics

13 years 6 months ago

Herbrand Theorems and Skolemization for Prenex Fuzzy Logics

Download sitemason.vanderbilt.edu

Approximate Herbrand theorems are established for first-order fuzzy logics based on continuous t-norms, and used to provide proof-theoretic proofs of Skolemization for their Prenex fragments. Decidability and complexity results for particular fragments are obtained as consequences.

Matthias Baaz, George Metcalfe

Real-time Traffic

Applied Computing | Approximate Herbrand Theorems | CIE 2008 | First-order Fuzzy Logics | Prenex Fragments |

claim paper

Related Content

» Herbrands Theorem Skolemization and Proof Systems for FirstOrder Lukasiewicz Logic

» On Skolemization in constructive theories

» A prooftheoretical investigation of global intuitionistic fuzzy logic

Post Info
More Details (n/a)

Added	12 Oct 2010
Updated	12 Oct 2010
Type	Conference
Year	2008
Where	CIE
Authors	Matthias Baaz, George Metcalfe

Comments (0)