The following pages link to (Q4499084):
Displaying 50 items.
- Incomplete symbols -- definite descriptions revisited (Q253123) (← links)
- On rules (Q266650) (← links)
- Glivenko sequent classes in the light of structural proof theory (Q283115) (← links)
- Cut elimination for GLS using the terminability of its regress process (Q288243) (← links)
- Natural deduction for the Sheffer stroke and Peirce's arrow (and any other truth-functional connective) (Q288247) (← links)
- Analytic rules for mereology (Q300557) (← links)
- Proof complexity and textual cohesion (Q302177) (← links)
- The Lambek calculus extended with intuitionistic propositional logic (Q332086) (← links)
- A decidable theory of type assignment (Q365669) (← links)
- A proof-search procedure for intuitionistic propositional logic (Q377482) (← links)
- Does the deduction theorem fail for modal logic? (Q383061) (← links)
- Analytic calculi for circular concepts by finite revision (Q383558) (← links)
- Socratic trees (Q383562) (← links)
- Self-referentiality of Brouwer-Heyting-Kolmogorov semantics (Q392298) (← links)
- Algorithmic introduction of quantified cuts (Q402115) (← links)
- Proof systems for Moss' coalgebraic logic (Q402120) (← links)
- The Peirce translation (Q408162) (← links)
- Algebraic proof theory for substructural logics: cut-elimination and completions (Q409322) (← links)
- Quantum-like logics and schizophrenia (Q420845) (← links)
- How to assign ordinal numbers to combinatory terms with polymorphic types (Q453195) (← links)
- A new model construction by making a detour via intuitionistic theories. I: Operational set theory without choice is \(\Pi_1\)-equivalent to KP (Q476116) (← links)
- A curious dialogical logic and its composition problem (Q484198) (← links)
- On non-self-referential fragments of modal logics (Q508827) (← links)
- Constructive belief reports (Q514084) (← links)
- How to deal with unbelievable assertions (Q524943) (← links)
- General-elimination stability (Q526738) (← links)
- Practical extraction of evidence terms from common-knowledge reasoning (Q530856) (← links)
- A simple proof of Parsons' theorem (Q558443) (← links)
- A sequent calculus for a negative free logic (Q622624) (← links)
- Hypersequent calculi for intuitionistic logic with classical atoms (Q636282) (← links)
- Inhabitation of polymorphic and existential types (Q636375) (← links)
- On the elimination of quantifier-free cuts (Q650922) (← links)
- Reasoning about collectively accepted group beliefs (Q652734) (← links)
- A generalized syllogistic inference system based on inclusion and exclusion relations (Q692203) (← links)
- Syntactic cut-elimination for a fragment of the modal mu-calculus (Q714717) (← links)
- Extension without cut (Q714731) (← links)
- CERES in higher-order logic (Q716500) (← links)
- On the expressive power of schemes (Q719245) (← links)
- Corrected upper bounds for free-cut elimination (Q719283) (← links)
- Towards a semantic characterization of cut-elimination (Q817704) (← links)
- Cut elimination for S4C: A case study (Q817705) (← links)
- The epsilon calculus and Herbrand complexity (Q817706) (← links)
- Intuitionistic non-normal modal logics: a general framework (Q829826) (← links)
- De Finettian logics of indicative conditionals. II: Proof theory and algebraic semantics (Q830363) (← links)
- A more unified approach to free logics (Q830379) (← links)
- Subminimal logics in light of Vakarelov's logic (Q831220) (← links)
- Fuzzy constructive logic (Q843607) (← links)
- Ordinal arithmetic: Algorithms and mechanization (Q851144) (← links)
- Resource operators for \(\lambda\)-calculus (Q876041) (← links)
- Dual erotetic calculi and the minimal \(\mathsf{LFI}\) (Q897482) (← links)
