Computer Science Logic
From MaRDI portal
(Redirected from Publication:5292654)
Computer Science Logic (scientific article; zbMATH DE number 5166505)
Computer Science Logic (scientific article; zbMATH DE number 5166505)
Recommendations
- Computer Science Logic
- A deterministic terminating sequent calculus for Godel-Dummett logic
- Goal-directed proof theory
- scientific article; zbMATH DE number 1696800
- scientific article; zbMATH DE number 6276272
- On goal-directed provability in classical logic
- Hypersequent Calculi for Godel Logics -- a Survey
- Sequent calculi for intuitionistic Gödel-Löb logic
- A multiple-conclusion calculus for first-order Gödel logic
- A Proof-theoretic Analysis of Goal-directed Provability
Cited in
(15)- Analytic calculi for product logics
- Terminating calculi for propositional Dummett logic with subformula property
- Gödel-Dummett counter-models through matrix computation
- A lambda calculus for Gödel-Dummett logic capturing waitfreedom
- On natural deduction for Herbrand constructive logics. I: Curry-Howard correspondence for Dummett's logic \(\mathsf {LC}\)
- Theorem proving for conditional logics: CondLean and GOALDUCK
- A deterministic terminating sequent calculus for Godel-Dummett logic
- On goal-directed provability in classical logic
- scientific article; zbMATH DE number 2090290 (Why is no real title available?)
- Automated Reasoning
- Computer Science Logic
- Bounding Resource Consumption with Gödel-Dummett Logics
- Semiconic idempotent logic. I: Structure and local deduction theorems.
- Semiconic idempotent logic. II: Beth definability and deductive interpolation
- Graph-based decision for Gödel-Dummett logics
This page was built for publication: Computer Science Logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5292654)
