On the semantics of classical disjunction
From MaRDI portal
Publication:5939825
DOI10.1016/S0022-4049(00)00161-4zbMath0981.03018OpenAlexW2078051080WikidataQ127725569 ScholiaQ127725569MaRDI QIDQ5939825
Publication date: 11 March 2002
Published in: Journal of Pure and Applied Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0022-4049(00)00161-4
Semantics in the theory of computing (68Q55) Categorical logic, topoi (03G30) Classical propositional logic (03B05) Proof theory in general (including proof-theoretic semantics) (03F03) Combinatory logic and lambda calculus (03B40)
Related Items (4)
Call-by-Value Is Dual to Call-by-Name, Extended ⋮ A short proof of the strong normalization of classical natural deduction with disjunction ⋮ On categorical models of classical logic and the Geometry of Interaction ⋮ Order-enriched categorical models of the classical sequent calculus
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the unity of logic
- The revised report on the syntactic theories of sequential control and state
- Call-by-name, call-by-value and the \(\lambda\)-calculus
- On the intuitionistic force of classical search
- Untersuchungen über das logische Schliessen. I
- HYPERDOCTRINES, NATURAL DEDUCTION AND THE BECK CONDITION
- On the intuitionistic force of classical search (Extended abstract)
- Proof-terms for classical and intuitionistic resolution
- Logic continuations
- The virtues of eta-expansion
- Sound and complete axiomatisations of call-by-value control operators
This page was built for publication: On the semantics of classical disjunction