Pages that link to "Item:Q1840143"
From MaRDI portal
The following pages link to Untersuchungen über das logische Schliessen. II (Q1840143):
Displaying 50 items.
- Proof-theoretic semantics, a problem with negation and prospects for modality (Q266652) (← links)
- Category theory, logic and formal linguistics: some connections, old and new (Q280832) (← links)
- The Lambek calculus extended with intuitionistic propositional logic (Q332086) (← links)
- A sequent calculus for a negative free logic (Q622624) (← links)
- On the computational complexity of cut-reduction (Q636310) (← links)
- Extraction of expansion trees (Q670704) (← links)
- CERES in higher-order logic (Q716500) (← links)
- Gentzen calculi for the existence predicate (Q817698) (← links)
- External and internal syntax of the \(\lambda \)-calculus (Q968531) (← links)
- Inferentializing semantics (Q975776) (← links)
- Programs and logics (Q1070221) (← links)
- Arithmetizing uniform \(NC\) (Q1176198) (← links)
- The disjunction property of intermediate propositional logics (Q1181482) (← links)
- Derivability of admissible rules (Q1245932) (← links)
- Deduction search in calculi of general type (Q1245945) (← links)
- On the relationship between compact regularity and Gentzen's cut rule (Q1434354) (← links)
- Harmony and autonomy in classical logic (Q1568714) (← links)
- Eliminating disjunctions by disjunction elimination (Q1688959) (← links)
- On the compressibility of finite languages and formal proofs (Q1706152) (← links)
- The computational content of arithmetical proofs (Q1762353) (← links)
- MELL in the calculus of structures (Q1884903) (← links)
- Consequence and confirmation (Q1906665) (← links)
- The predictive role of counterfactuals (Q1936326) (← links)
- Structural weakening and paradoxes (Q1982021) (← links)
- Herbrand's theorem as higher order recursion (Q1987218) (← links)
- Calculi for many-valued logics (Q2045004) (← links)
- Hopeful monsters: a note on multiple conclusions (Q2052149) (← links)
- Human-centered automated proof search (Q2069871) (← links)
- Oskar Becker and the modal translation of intuitionistic logic (Q2094160) (← links)
- Normalisation and subformula property for a system of classical logic with Tarski's rule (Q2118171) (← links)
- Resourceful program synthesis from graded linear types (Q2119110) (← links)
- The \textsf{nanoCoP 2.0} connection provers for classical, intuitionistic and modal logics (Q2142078) (← links)
- Between Hilbert and Gentzen: four-valued consequence systems and structural reasoning (Q2155493) (← links)
- Kneale's natural deductions as a notational variant of Beth's tableaus (Q2169120) (← links)
- Natural deduction bottom up (Q2236507) (← links)
- Proof theory for heterogeneous logic combining formulas and diagrams: proof normalization (Q2238136) (← links)
- Physics and proof theory (Q2249005) (← links)
- Cut-elimination: syntax and semantics (Q2259012) (← links)
- Deduction normalization theorem for Sette's logic and its modifications (Q2319976) (← links)
- Eight inference rules for implication (Q2323641) (← links)
- On the generation of quantified lemmas (Q2417949) (← links)
- Analyticity, balance and non-admissibility of \textit{Cut} in stoic logic (Q2422314) (← links)
- Towards a clausal analysis of cut-elimination (Q2457341) (← links)
- The justification of the logical laws revisited (Q2500811) (← links)
- Somehow things do not relate: on the interpretation of polyadic second-order logic (Q2516587) (← links)
- General proof theory: introduction (Q2631640) (← links)
- Free modal Riesz spaces are Archimedean: a syntactic proof (Q2695359) (← links)
- Requiem for logical nihilism, or: logical nihilism annihilated (Q2695400) (← links)
- On the complexity of proof deskolemization (Q2892685) (← links)
- Strong negation in intuitionistic style sequent systems for residuated lattices (Q2922496) (← links)
