Skolemization and Herbrand theorems for lattice-valued logics

DOI10.1016/j.tcs.2019.02.007zbMath1472.03022OpenAlexW2913358032WikidataQ128370524 ScholiaQ128370524MaRDI QIDQ1733060

Denisa Diaconescu, Petr Cintula, George Metcalfe

Publication date: 26 March 2019

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://boris.unibe.ch/127736/

zbMATH Keywords

latticesnon-classical logicsSkolemizationHerbrand theorems

Mathematics Subject Classification ID

Many-valued logic (03B50)

Related Items (1)

First-order interpolation derived from propositional interpolation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algebraic proof theory for substructural logics: cut-elimination and completions
• Residuated lattices. An algebraic glimpse at substructural logics
• Handbook of proof theory
• Metamathematics of fuzzy logic
• Lattice-valued logic. An alternative approach to treat fuzziness and incomparability
• Making fuzzy description logic more general
• Herbrand Theorems for Substructural Logics
• Herbrand's Theorem, Skolemization and Proof Systems for First-Order Lukasiewicz Logic
• Skolemization for Substructural Logics
• On Skolemization in constructive theories
• Proving termination with multiset orderings
• Skolemization in intermediate logics with the finite model property
• A HENKIN-STYLE PROOF OF COMPLETENESS FOR FIRST-ORDER ALGEBRAIZABLE LOGICS
• A theorem about infinite-valued sentential logic
• Bounded lattice expansions

This page was built for publication: Skolemization and Herbrand theorems for lattice-valued logics