Pages that link to "Item:Q4006233"

The following pages link to A new constructive logic: classic logic (Q4006233):

Displaying 50 items.

• A micrological study of negation (Q345707) (← links)
• Safe recursion revisited. I: Categorical semantics for lower complexity (Q386608) (← links)
• Böhm theorem and Böhm trees for the \(\varLambda \mu\)-calculus (Q428894) (← links)
• Preface to the special volume (Q534064) (← links)
• Polarized and focalized linear and classical proofs (Q556824) (← links)
• Resource modalities in tensor logic (Q636303) (← links)
• Classical proof forestry (Q636369) (← links)
• A focused approach to combining logics (Q639671) (← links)
• On the unity of logic (Q685059) (← links)
• A categorical semantics for polarized MALL (Q866570) (← links)
• Focusing and polarization in linear, intuitionistic, and classical logics (Q1035706) (← links)
• Constructive logics. I: A tutorial on proof systems and typed \(\lambda\)- calculi (Q1208732) (← links)
• Total sets and objects in domain theory (Q1210138) (← links)
• Classical logic, storage operators and second-order lambda-calculus (Q1326769) (← links)
• Semantics of weakening and contraction (Q1337357) (← links)
• Computational isomorphisms in classical logic (Q1398471) (← links)
• Linear logic and elementary time (Q1401946) (← links)
• A semantic framework for proof evidence (Q1701039) (← links)
• Classical realizability in the CPS target language (Q1744381) (← links)
• About classical logic and imperative programming (Q1817076) (← links)
• Polarized proof-nets and \(\lambda \mu\)-calculus (Q1853586) (← links)
• The additive multiboxes (Q1861326) (← links)
• Polarized games (Q1886321) (← links)
• Petri nets, Horn programs, linear logic and vector games (Q1899147) (← links)
• Proof nets for classical logic (Q1982017) (← links)
• The multiplicative-additive Lambek calculus with subexponential and bracket modalities (Q2035845) (← links)
• A pure view of ecumenical modalities (Q2148808) (← links)
• A proof theory for model checking (Q2331070) (← links)
• Proof diagrams for multiplicative linear logic: syntax and semantics (Q2331072) (← links)
• Quantitative classical realizability (Q2343127) (← links)
• Cut elimination for the unified logic (Q2367410) (← links)
• A proof-theoretic foundation of abortive continuations (Q2464725) (← links)
• On the unity of duality (Q2482843) (← links)
• Non-commutative proof construction: a constraint-based approach (Q2503402) (← links)
• Syntax vs. semantics: A polarized approach (Q2570132) (← links)
• Proof checking and logic programming (Q2628296) (← links)
• Call-By-Push-Value from a Linear Logic Point of View (Q2802478) (← links)
• Propositions as sessions (Q2875234) (← links)
• A Categorical Setting for Lower Complexity (Q3178259) (← links)
• Linear $$ \lambda \mu $$ is $$ \textsc {CP} $$ (more or less) (Q3188293) (← links)
• An Indexed System for Multiplicative Additive Polarized Linear Logic (Q3540184) (← links)
• Differential Linear Logic and Polarization (Q3637207) (← links)
• Constructive negation, implication, and co-implication (Q3643320) (← links)
• Enriching an Effect Calculus with Linear Types (Q3644752) (← links)
• Focalisation and Classical Realisability (Q3644763) (← links)
• (Q4222826) (← links)
• (Q4222847) (← links)
• Games and full completeness for multiplicative linear logic (Q4302352) (← links)
• A new deconstructive logic: linear logic (Q4372906) (← links)
• Proofs of strong normalisation for second order classical natural deduction (Q4382485) (← links)