Pages that link to "Item:Q4255973"
From MaRDI portal
The following pages link to A deterministic terminating sequent calculus for Godel-Dummett logic (Q4255973):
Displaying 15 items.
- Proof analysis in intermediate logics (Q661286) (← links)
- Graph-based decision for Gödel-Dummett logics (Q877886) (← links)
- Fast decision procedure for propositional Dummett logic based on a multiple premise tableau calculus (Q991900) (← links)
- A cut-free calculus for second-order Gödel logic (Q1677040) (← links)
- Terminating calculi for propositional Dummett logic with subformula property (Q2352485) (← links)
- Decision methods for linearly ordered Heyting algebras (Q2491077) (← links)
- (Q2721190) (← links)
- Gödel-Dummett counter-models through matrix computation (Q2848063) (← links)
- A Lambda Calculus for Gödel–Dummett Logic Capturing Waitfreedom (Q2900262) (← links)
- A Multiple-Conclusion Calculus for First-Order Gödel Logic (Q3007648) (← links)
- A Hypersequent System for Gödel-Dummett Logic with Non-constant Domains (Q3010373) (← links)
- Hypersequent Calculi for Godel Logics -- a Survey (Q4812316) (← links)
- Terminating sequent calculi for proving and refuting formulas in S4 (Q5176550) (← links)
- Computer Science Logic (Q5292654) (← links)
- Automated Reasoning (Q5307065) (← links)