Labelled Calculi for Łukasiewicz Logics
From MaRDI portal
Publication:3511458
DOI10.1007/978-3-540-69937-8_17zbMATH Open1156.03024OpenAlexW1579910356MaRDI QIDQ3511458FDOQ3511458
Authors: Didier Galmiche, Yakoub Salhi 
Publication date: 10 July 2008
Published in: Logic, Language, Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-69937-8_17
Recommendations
Cites Work
- Metamathematics of fuzzy logic
- Title not available (Why is that?)
- Automated Reasoning
- Proving termination with multiset orderings
- Sequent and hypersequent calculi for abelian and łukasiewicz logics
- Title not available (Why is that?)
- Tableaux for Łukasiewicz infinite-valued logic
- Finiteness in infinite-valued Łukasiewicz logic
- Logic for Programming, Artificial Intelligence, and Reasoning
- Title not available (Why is that?)
- Contraction-free sequent calculi for intuitionistic logic
- Bounded contraction and Gentzen-style formulation of Łukasiewicz logics
- Bounded Łukasiewicz logics
- Łukasiewicz Logic: From Proof Systems To Logic Programming
Cited In (8)
- Intuitionistic Letcc via Labelled Deduction
- Labeled calculi and finite-valued logics
- Łukasiewicz Logic: From Proof Systems To Logic Programming
- Intuitionistic hybrid logic: introduction and survey
- Sequent calculi and decidability for intuitionistic hybrid logic
- Effective finite-valued semantics for labelled calculi
- Tableaux for Łukasiewicz infinite-valued logic
- Infinite-valued first-order Łukasiewicz logic: hypersequent calculi without structural rules and proof search for sentences in the prenex form
This page was built for publication: Labelled Calculi for Łukasiewicz Logics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3511458)
