The following pages link to (Q5560258):
Displaying 50 items.
- Inconsistency-adaptive dialogical logic (Q263112) (← links)
- Interpolation systems for ground proofs in automated deduction: a survey (Q287275) (← links)
- Semantically-guided goal-sensitive reasoning: model representation (Q287333) (← links)
- Completeness and decidability results for CTL in constructive type theory (Q287375) (← links)
- On all strong Kleene generalizations of classical logic (Q295922) (← links)
- From reasonable preferences, via argumentation, to logic (Q334156) (← links)
- Subalternation and existence presuppositions in an unconventionally formalized canonical square of opposition (Q346759) (← links)
- Socratic trees (Q383562) (← links)
- Intuitionistic completeness of first-order logic (Q392280) (← links)
- Prefixed tableaus and nested sequents (Q409323) (← links)
- Assertoric semantics and the computational power of self-referential truth (Q427223) (← links)
- Tolerant, classical, strict (Q427233) (← links)
- Incremental variable splitting (Q429591) (← links)
- \(\lim +, \delta^+\), and non-permutability of \(\beta\)-steps (Q429596) (← links)
- Analytic tableaux for higher-order logic with choice (Q438561) (← links)
- First-order dialogical games and tableaux (Q484155) (← links)
- A curious dialogical logic and its composition problem (Q484198) (← links)
- Finite additivity, another lottery paradox and conditionalisation (Q484946) (← links)
- First-order logic and first-order functions (Q497872) (← links)
- Tableau systems for deontic action logics based on finite Boolean algebras, and their complexity (Q526730) (← links)
- Proof and refutation in MALL as a game (Q636305) (← links)
- Interval logics and their decision procedures. I: An interval logic (Q671639) (← links)
- Logical foundations for programming semantics (Q685420) (← links)
- A framework for the transfer of proofs, lemmas and strategies from classical to non classical logics (Q687153) (← links)
- Theory matrices (for modal logics) using alphabetical monotonicity (Q687154) (← links)
- Identity in modal logic theorem proving (Q687161) (← links)
- The relative complexity of analytic tableaux and SL-resolution (Q687165) (← links)
- Revising Carnap's semantic conception of modality (Q694493) (← links)
- Linearity and regularity with negation normal form (Q703486) (← links)
- The logic of proofs, semantically (Q703832) (← links)
- A framework for proof systems (Q707742) (← links)
- PNL to HOL: from the logic of nominal sets to the logic of higher-order functions (Q714797) (← links)
- Bivalent semantics, generalized compositionality and analytic classic-like tableaux for finite-valued logics (Q744990) (← links)
- Cut elimination and word problems for varieties of lattices (Q786808) (← links)
- The temporal logic of branching time (Q789895) (← links)
- A tableau-based decision procedure for a fragment of set theory with iterated membership (Q812437) (← links)
- Socratic proofs and paraconsistency: A case study (Q813092) (← links)
- Two party immediate response disputes: Properties and efficiency (Q814510) (← links)
- Admissibility of cut in LC with fixed point combinator (Q817697) (← links)
- Quantified temporal alethic boulesic doxastic logic (Q828771) (← links)
- Reasoning about coalitional games (Q834401) (← links)
- Cut and pay (Q851192) (← links)
- Innovations in computational type theory using Nuprl (Q865639) (← links)
- A sound framework for \(\delta\)-rule variants in free-variable semantic tableaux (Q877883) (← links)
- The disconnection tableau calculus (Q877889) (← links)
- Liberalized variable splitting (Q877894) (← links)
- Passive induction and a solution to a Paris-Wilkie open question (Q882120) (← links)
- Dual erotetic calculi and the minimal \(\mathsf{LFI}\) (Q897482) (← links)
- A continuum-valued logic of degrees of probability (Q907883) (← links)
- A first order logic for partial functions (Q918965) (← links)
