scientific article; zbMATH DE number 3815606

MaRDI QIDQ3663260zbMATH OpenFDO

Authors Matthias Emil Ragaz

Publication date 1981

zbMATH Keywords

consequence relationarithmetical hierarchycomplete theoryelimination of quantifiersrecursive setconsistent sentencesreal truth values

Mathematics Subject Classification ID

Many-valued logic (03B50) Basic properties of first-order languages and structures (03C07) Hierarchies of computability and definability (03D55)

Cited in

(17)

• Repetition-free and infinitary analytic calculi for first-order rational Pavelka logic
• A note on the first‐order logic of complete BL‐chains
• Die Unentscheidbarkeit der einstelligen unendlichwertigen Prädikatenlogik
• Distinguished algebraic semantics for t-norm based fuzzy logics: methods and algebraic equivalencies
• Herbrand Theorems and Skolemization for Prenex Fuzzy Logics
• Die Nichtaxiomatisierbarkeit der unendlichwertigen Mengenlehre
• Monotone operators on Gödel logic
• Notes on Strong Completeness in Łukasiewicz, Product and BL Logics and in Their First-Order Extensions
• Arithmetical complexity of fuzzy predicate logics -- a survey. II.
• On arithmetic in the Cantor-Łukasiewicz fuzzy set theory
• On the predicate logics of continuous t-norm BL-algebras
• Rational Pavelka logic: the best among three worlds?
• Giles's game and the proof theory of Łukasiewicz logic
• Comparing Calculi for First-Order Infinite-Valued Łukasiewicz Logic and First-Order Rational Pavelka Logic
• Infinite-valued first-order Łukasiewicz logic: hypersequent calculi without structural rules and proof search for sentences in the prenex form
• Arithmetical complexity of fuzzy predicate logics -- a survey
• Forcing in Łukasiewicz predicate logic

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3663260)