scientific article; zbMATH DE number 3815606
From MaRDI portal
Publication:3663260
zbMATH Open0516.03011MaRDI QIDQ3663260FDOQ3663260
Publication date: 1981
Title of this publication is not available (Why is that?)
consequence relationarithmetical hierarchycomplete theoryelimination of quantifiersrecursive setconsistent sentencesreal truth values
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
- Herbrand Theorems and Skolemization for Prenex Fuzzy Logics
- Distinguished algebraic semantics for t-norm based fuzzy logics: methods and algebraic equivalencies
- Die Nichtaxiomatisierbarkeit der unendlichwertigen Mengenlehre
- Infinite-Valued First-Order Łukasiewicz Logic: Hypersequent Calculi Without Structural Rules and Proof Search for Sentences in the Prenex Form
- Notes on Strong Completeness in Łukasiewicz, Product and BL Logics and in Their First-Order Extensions
- Monotone operators on Gödel logic
- On arithmetic in the Cantor-Łukasiewicz fuzzy set theory
- Arithmetical complexity of fuzzy predicate logics -- a survey. II.
- Rational Pavelka logic: the best among three worlds?
- On the predicate logics of continuous t-norm BL-algebras
- 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
- 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)
