scientific article
From MaRDI portal
Publication:3663260
zbMath0516.03011MaRDI QIDQ3663260
Publication date: 1981
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
consequence relationarithmetical hierarchyelimination of quantifierscomplete theoryrecursive setconsistent sentencesreal truth values
Many-valued logic (03B50) Basic properties of first-order languages and structures (03C07) Hierarchies of computability and definability (03D55)
Related Items
On arithmetic in the Cantor-Łukasiewicz fuzzy set theory ⋮ Infinite-Valued First-Order Łukasiewicz Logic: Hypersequent Calculi Without Structural Rules and Proof Search for Sentences in the Prenex Form ⋮ Rational Pavelka logic: the best among three worlds? ⋮ Comparing Calculi for First-Order Infinite-Valued Łukasiewicz Logic and First-Order Rational Pavelka Logic ⋮ Herbrand Theorems and Skolemization for Prenex Fuzzy Logics ⋮ A note on the first‐order logic of complete BL‐chains ⋮ Repetition-free and infinitary analytic calculi for first-order rational Pavelka logic ⋮ Monotone operators on Gödel logic ⋮ Forcing in Łukasiewicz predicate logic ⋮ Die Unentscheidbarkeit der einstelligen unendlichwertigen Prädikatenlogik ⋮ Die Nichtaxiomatisierbarkeit der unendlichwertigen Mengenlehre ⋮ On the predicate logics of continuous t-norm BL-algebras ⋮ Notes on Strong Completeness in Łukasiewicz, Product and BL Logics and in Their First-Order Extensions ⋮ Distinguished algebraic semantics for t-norm based fuzzy logics: methods and algebraic equivalencies ⋮ Arithmetical complexity of fuzzy predicate logics -- a survey. II. ⋮ Giles's game and the proof theory of Łukasiewicz logic ⋮ Arithmetical complexity of fuzzy predicate logics -- a survey
