scientific article; zbMATH DE number 3190338

zbMATH Open0117.01303MaRDI QIDQ5726697FDOQ5726697

Authors: Paul Lorenzen 

Publication date: 1961

Title of this publication is not available (Why is that?)

zbMATH Keywords

mathematical logic

Cited In (25)

• The logic of tasks
• Game-theoretic semantics for \(\mathrm{ATL}^+\) with applications to model checking
• Alternating-time temporal logic ATL with finitely bounded semantics
• Dialogspiele als Semantische Grundlage von Logikkalkülen
• A game semantics for linear logic
• Resource modalities in tensor logic
• Material dialogues for first-order logic in constructive type theory
• Good-for-Game QPTL: An Alternating Hodges Semantics
• Introduction to computability logic
• Strict finitism and feasibility
• Full abstraction for PCF
• Build your own clarithmetic. I: Setup and completeness
• Dialogues and Proofs; Yankov’s Contribution to Proof Theory
• The intuitionistic fragment of computability logic at the propositional level
• The Rényi-Ulam games and many-valued logics
• From truth to computability. I.
• Lorenzen’s Correspondence with Hasse, Krull, and Aubert, Together with Some Relevant Documents
• A game semantics for disjunctive logic programming
• Proof and refutation in MALL as a game
• Material dialogues for first-order logic in constructive type theory: extended version
• Toward the interpretation of non-constructive reasoning as non-monotonic learning
• A propositional cirquent calculus for computability logic.
• A constructive game semantics for the language of linear logic
• Alternating (in)dependence-friendly logic
• A semantic framework for proof evidence

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5726697)