Pages that link to "Item:Q2732138"
From MaRDI portal
The following pages link to Locus Solum: From the rules of logic to the logic of rules (Q2732138):
Displayed 50 items.
- Formal ontologies and coherent spaces (Q280844) (← links)
- Intuitionistic games: determinacy, completeness, and normalization (Q332080) (← links)
- Imperative programs as proofs via game semantics (Q388203) (← links)
- Figures of dialogue: a view from ludics (Q408341) (← links)
- An approach to innocent strategies as graphs (Q418201) (← links)
- Böhm theorem and Böhm trees for the \(\varLambda \mu\)-calculus (Q428894) (← links)
- The relational model is injective for multiplicative exponential linear logic (without weakenings) (Q435194) (← links)
- Preface to the special volume (Q534064) (← links)
- Geometry of interaction. V: Logic in the hyperfinite factor (Q534694) (← links)
- Computational ludics (Q534713) (← links)
- Constructive semantics for instantaneous reactions (Q631753) (← links)
- Proof and refutation in MALL as a game (Q636305) (← links)
- Substitution in non-wellfounded syntax with variable binding (Q703526) (← links)
- Softness of hypercoherences and MALL full completeness (Q705530) (← links)
- Interaction graphs: multiplicatives (Q714715) (← links)
- Interactive observability in Ludics: the geometry of tests (Q817844) (← links)
- A calculus of coroutines (Q817847) (← links)
- Differential interaction nets (Q860836) (← links)
- A categorical semantics for polarized MALL (Q866570) (← links)
- A logical characterization of forward and backward chaining in the inverse method (Q928660) (← links)
- Parametric \(\lambda \)-theories (Q930867) (← links)
- Uniformity and the Taylor expansion of ordinary lambda-terms (Q944386) (← links)
- An exact correspondence between a typed pi-calculus and polarised proof-nets (Q974114) (← links)
- From Hilbert's program to a logic tool box (Q1028646) (← links)
- Classical realizability in the CPS target language (Q1744381) (← links)
- Polarized games (Q1886321) (← links)
- Proof nets for classical logic (Q1982017) (← links)
- Game of grounds (Q2080589) (← links)
- On dialogue games and graph games (Q2130592) (← links)
- Between syntax and semantics of resource oriented logic for IDS behavior description (Q2201272) (← links)
- An interpretation of CCS into ludics (Q2333316) (← links)
- Realizability models for a linear dependent PCF (Q2346992) (← links)
- Structure of proofs and the complexity of cut elimination (Q2368983) (← links)
- On the unity of duality (Q2482843) (← links)
- Syntax vs. semantics: A polarized approach (Q2570132) (← links)
- Call-By-Push-Value from a Linear Logic Point of View (Q2802478) (← links)
- Contraction-free Proofs and Finitary Games for Linear Logic (Q2805162) (← links)
- A Graph Abstract Machine Describing Event Structure Composition (Q2867884) (← links)
- Observational Equivalence for the Interaction Combinators and Internal Separation (Q2867902) (← links)
- Game Semantics and the Manifestation Thesis (Q2908761) (← links)
- Theorems as Constructive Visions (Q2915840) (← links)
- Structural Focalization (Q2946730) (← links)
- Aristotle on Universal Quantification: A Study from the Point of View of Game Semantics (Q2963961) (← links)
- Dialogues in Ludics (Q3013028) (← links)
- Cut as Consequence (Q3019775) (← links)
- On the Meaning of Focalization (Q3080087) (← links)
- Non-uniform (hyper/multi)coherence spaces (Q3081320) (← links)
- From Focalization of Logic to the Logic of Focalization (Q3178251) (← links)
- Verificationism and Classical Realizability (Q3305313) (← links)
- A System F with Call-by-Name Exceptions (Q3519511) (← links)