Labelled Calculi for Łukasiewicz Logics
From MaRDI portal
Publication:3511458
Recommendations
Cites work
- scientific article; zbMATH DE number 1612545 (Why is no real title available?)
- scientific article; zbMATH DE number 4083375 (Why is no real title available?)
- scientific article; zbMATH DE number 949290 (Why is no real title available?)
- Automated Reasoning
- Bounded contraction and Gentzen-style formulation of Łukasiewicz logics
- Bounded Łukasiewicz logics
- Contraction-free sequent calculi for intuitionistic logic
- Finiteness in infinite-valued Łukasiewicz logic
- Logic for Programming, Artificial Intelligence, and Reasoning
- Metamathematics of fuzzy logic
- Proving termination with multiset orderings
- Sequent and hypersequent calculi for abelian and łukasiewicz logics
- Tableaux for Łukasiewicz infinite-valued logic
- Ł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)