Herbrand Theorems and Skolemization for Prenex Fuzzy Logics

Authors:
Matthias Baaz;George Metcalfe
Affiliations:
Institute of Discrete Mathematics and Geometry, Technical University Vienna, Wien, Austria A-1040;Department of Mathematics, Vanderbilt University, Nashville, USA TN 37240
Venue:
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
Year:
2008

Citing 7
Cited 0

Herbrand's Theorem for Prenex Gödel Logic and its Consequences for Theorem Proving

LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Hypersequent and the Proof Theory of Intuitionistic Fuzzy Logic

Proceedings of the 14th Annual Conference of the EACSL on Computer Science Logic
Analytic calculi for monoidal t-norm based logic

Fundamenta Informaticae
Arithmetical complexity of fuzzy predicate logics – a survey

Soft Computing - A Fusion of Foundations, Methodologies and Applications
Reasoning within fuzzy description logics

Journal of Artificial Intelligence Research
Making fuzzy description logic more general

Fuzzy Sets and Systems
Herbrand's Theorem, Skolemization and Proof Systems for First-Order Łukasiewicz Logic

Journal of Logic and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.