The following pages link to (Q3972527):
Displaying 33 items.
- Tableau reductions: towards an optimal decision procedure for the modal necessity (Q313007) (← links)
- Cut elimination in coalgebraic logics (Q618171) (← links)
- 3-SAT = SAT for a class of normal modal logics (Q673009) (← links)
- Complexity of subclasses of the intuitionistic propositional calculus (Q688732) (← links)
- Proof theory of Nelson's paraconsistent logic: a uniform perspective (Q764309) (← links)
- Resolution is cut-free (Q972424) (← links)
- Linearizing intuitionistic implication (Q1210141) (← links)
- Resolution calculus for the first order linear logic (Q1314284) (← links)
- A Gentzen system for conditional logic (Q1327484) (← links)
- Proof strategies in linear logic (Q1340963) (← links)
- Completeness of a first-order temporal logic with time-gaps (Q1350524) (← links)
- A polynomial space construction of tree-like models for logics with local chains of modal connectives (Q1399966) (← links)
- Proof-search in type-theoretic languages: An introduction (Q1575935) (← links)
- Clausal resolution in a logic of rational agency (Q1606116) (← links)
- Resolution with order and selection for hybrid logics (Q2429982) (← links)
- On temporal logic S4Dbr (Q2471628) (← links)
- Gentzen-like systems for partial propositional calculi. I. II (Q2534156) (← links)
- Path calculus in the modal logic S4 (Q2571516) (← links)
- Admissibility of cut in coalgebraic logics (Q2873670) (← links)
- Intuitionistic Decision Procedures Since Gentzen (Q3305556) (← links)
- Decidability of the Class E by Maslov’s Inverse Method (Q3586019) (← links)
- (Q4281258) (← links)
- Three faces of natural deduction (Q4610312) (← links)
- A resolution theorem prover for intuitionistic logic (Q4647496) (← links)
- Proof-terms for classical and intuitionistic resolution (Q4647497) (← links)
- Optimized encodings of fragments of type theory in first order logic (Q4647585) (← links)
- What you always wanted to know about rigid E-unification (Q5235253) (← links)
- Complexity of translations from resolution to sequent calculus (Q5236549) (← links)
- Finite tree-countermodels via refutation systems in extensions of positive logic with strong negation (Q6146289) (← links)
- Resolution calculi for non-normal modal logics (Q6541160) (← links)
- Improved decision procedures for the modal logics K, T and S4 (Q6560176) (← links)
- Dual tableau-based decision procedures for fragments of the logic of binary relations (Q6599613) (← links)
- Proof-theoretic results of common sense modal predicate calculi (Q6601690) (← links)
