The following pages link to (Q5559220):
Displaying 50 items.
- Proof-theoretic semantics, a problem with negation and prospects for modality (Q266652) (← links)
- Reconsidering pairs and functions as sets (Q286796) (← links)
- Natural deduction for the Sheffer stroke and Peirce's arrow (and any other truth-functional connective) (Q288247) (← links)
- An expressivist bilateral meaning-is-use analysis of classical propositional logic (Q302171) (← links)
- Natural deduction calculi and sequent calculi for counterfactual logics (Q332082) (← links)
- Proof theory for reasoning with Euler diagrams: a logic translation and normalization (Q361868) (← links)
- The epistemic significance of valid inference (Q383064) (← links)
- The categorical and the hypothetical: a critique of some fundamental assumptions of standard semantics (Q383070) (← links)
- Existential type systems between Church and Curry style (type-free style) (Q402117) (← links)
- Intuitionism and the liar paradox (Q448337) (← links)
- Bounded memory Dolev-Yao adversaries in collaborative systems (Q462499) (← links)
- Bilateralism in proof-theoretic semantics (Q484102) (← links)
- A logic inspired by natural language: quantifiers as subnectors (Q484201) (← links)
- First order expressivist logic (Q485622) (← links)
- Compositional Z: confluence proofs for permutative conversion (Q514511) (← links)
- On harmony and permuting conversions (Q518743) (← links)
- General-elimination stability (Q526738) (← links)
- A categorical interpretation of the intuitionistic, typed, first order logic with Hilbert's \(\varepsilon\)-terms (Q528519) (← links)
- Yet another bijection between sequent calculus and natural deduction (Q530853) (← links)
- Formalisation in constructive type theory of Stoughton's substitution for the lambda calculus (Q530864) (← links)
- Normalization and excluded middle. I (Q583185) (← links)
- On Goedel speed-up and succinctness of language representations (Q594584) (← links)
- The decidability of a fragment of \(\text{BB}'\text{IW}\)-logic (Q596035) (← links)
- General-elimination harmony and the meaning of the logical constants (Q600850) (← links)
- The nature of information: a relevant approach (Q625698) (← links)
- Implications-as-rules vs. implications-as-links: an alternative implication-left schema for the sequent calculus (Q626494) (← links)
- Logical foundations for programming semantics (Q685420) (← links)
- Functional interpretations of feasibly constructive arithmetic (Q685962) (← links)
- Theo: An interactive proof development system (Q688727) (← links)
- Partial inductive definitions as type-systems for \(\lambda\)-terms (Q688729) (← links)
- A generalized syllogistic inference system based on inclusion and exclusion relations (Q692203) (← links)
- Natural deduction for dual-intuitionistic logic (Q694491) (← links)
- A framework for proof systems (Q707742) (← links)
- A new normalization strategy for the implicational fragment of classical propositional logic (Q708929) (← links)
- PNL to HOL: from the logic of nominal sets to the logic of higher-order functions (Q714797) (← links)
- Pedagogical second-order \(\lambda \)-calculus (Q732007) (← links)
- The \(\lambda \)-calculus and the unity of structural proof theory (Q733755) (← links)
- Truth-value semantics and functional extensions for classical logic of partial terms based on equality (Q740205) (← links)
- Method of invariant transformations and logical deduction (Q759745) (← links)
- Wythoff games, continued fractions, cedar trees and Fibonacci searches (Q761983) (← links)
- A modal logic internalizing normal proofs (Q764264) (← links)
- Proof theory of Nelson's paraconsistent logic: a uniform perspective (Q764309) (← links)
- Correctness of programs with Pascal-like procedures without global variables (Q790607) (← links)
- Principal type schemes for an extended type theory (Q790801) (← links)
- To be and not to be: Dialectical tense logic (Q791513) (← links)
- Completeness of type assignment in continuous lambda models (Q792995) (← links)
- The structure of free closed categories (Q803265) (← links)
- Extraction of redundancy-free programs from constructive natural deduction proofs (Q808284) (← links)
- Simple consequence relations (Q809992) (← links)
- Comparing formal theories of context in AI (Q814585) (← links)
