English
Related papers

Related papers: From Intuitionism to Many-Valued Logics through Kr…

200 papers

I show that propositional intuitionistic logic is complete with respect to an adaptation of Dummett's pragmatist justification procedure. In particular, given a pragmatist justification of an argument, I show how to obtain a natural…

Logic · Mathematics 2019-03-19 Hermógenes Oliveira

The language of linear temporal logic can be interpreted over the class of dynamic topological systems, giving rise to the intuitionistic temporal logic ${{\sf ITL}^{\sf c}}_{\Diamond,\forall}$, recently shown to be decidable by…

Logic in Computer Science · Computer Science 2019-10-03 Joseph Boudou , Martín Diéguez , David Fernández-Duque

Propositional G\"odel logic extends intuitionistic logic with the non-constructive principle of linearity $A\rightarrow B\ \lor\ B\rightarrow A$. We introduce a Curry-Howard correspondence for this logic and show that a particularly simple…

Logic in Computer Science · Computer Science 2017-06-20 Federico Aschieri , Agata Ciabattoni , Francesco A. Genco

Based on the ideas of quantum theory of open systems (QTOS) we propose the consistent approach to study probabilistic many-valued propositional logic of intelligent devices that are composed from separate but interconnected logical units.…

Quantum Physics · Physics 2013-01-24 E. D. Vol

A dynamical system is a pair $(X,f)$, where $X$ is a topological space and $f\colon X\to X$ is continuous. Kremer observed that the language of propositional linear temporal logic can be interpreted over the class of dynamical systems,…

Logic · Mathematics 2023-06-22 David Fernández-Duque

How can we reason around logical paradoxes without falling into them? This paper introduces grounded deduction or GD, a Kripke-inspired approach to first-order logic and arithmetic that is neither classical nor intuitionistic, but…

Logic · Mathematics 2025-04-07 Bryan Ford

Models of complex systems are widely used in the physical and social sciences, and the concept of layering, typically building upon graph-theoretic structure, is a common feature. We describe an intuitionistic substructural logic called…

Logic in Computer Science · Computer Science 2023-06-22 Simon Docherty , David Pym

In the 1950-ies P. F. Strawson proposed the Logic of Presuppositions. In this system sentences with empty subject are considered neither true nor false. Strawson considered only simple sentences with two predicate letters. But the concept…

Logic in Computer Science · Computer Science 2020-01-29 X. Y. Newberry

In Outline of a Theory of Truth, Kripke introduces some of the central concepts of the logical study of truth and paradox. He informally defines some of these -- such as groundedness and paradoxicality -- using modal locutions. We introduce…

Logic · Mathematics 2025-03-27 James Walsh

In recent years, the logic of questions and dependencies has been investigated in the closely related frameworks of inquisitive logic and dependence logic. These investigations have assumed classical logic as the background logic of…

Logic · Mathematics 2020-11-11 Ivano Ciardelli , Rosalie Iemhoff , Fan Yang

We prove that there are continuum-many axiomatic extensions of the full Lambek calculus with exchange that have the deductive interpolation property. Further, we extend this result to both classical and intuitionistic linear logic as well…

Logic · Mathematics 2023-08-04 Wesley Fussner , Simon Santschi

The KLM approach to defeasible reasoning introduces a weakened form of implication into classical logic. This allows one to incorporate exceptions to general rules into a logical system, and for old conclusions to be withdrawn upon learning…

Artificial Intelligence · Computer Science 2024-10-08 Nicholas Leisegang , Thomas Meyer , Sebastian Rudolph

Prawitz conjectured that the proof-theoretically valid logic is intuitionistic logic. Recent work on proof-theoretic validity has disproven this. In fact, it has been shown that proof-theoretic validity is not even closed under…

Logic · Mathematics 2022-11-24 Will Stafford , Victor Nascimento

Defeasible logic is a rule-based nonmonotonic logic, with both strict and defeasible rules, and a priority relation on rules. We show that inference in the propositional form of the logic can be performed in linear time. This contrasts…

Artificial Intelligence · Computer Science 2009-09-29 Michael J. Maher

We introduce a basic intuitionistic conditional logic $\mathsf{IntCK}$ that we show to be complete both relative to a special type of Kripke models and relative to a standard translation into first-order intuitionistic logic. We show that…

Logic · Mathematics 2023-06-21 Grigory Olkhovikov

Epistemic logic has become a major field of philosophical logic ever since the groundbreaking work by Hintikka (1962). Despite its various successful applications in theoretical computer science, AI, and game theory, the technical…

Artificial Intelligence · Computer Science 2016-11-24 Yanjing Wang

We consider G\"odel temporal logic ($\sf GTL$), a variant of linear temporal logic based on G\"odel--Dummett propositional logic. In recent work, we have shown this logic to enjoy natural semantics both as a fuzzy logic and as a…

Logic in Computer Science · Computer Science 2022-12-05 Juan Pablo Aguilera , Martín Diéguez , David Fernández-Duque , Brett McLean

Justification logics are epistemic logics that explicitly include justifications for the agents' knowledge. We develop a multi-agent justification logic with evidence terms for individual agents as well as for common knowledge. We define a…

Logic in Computer Science · Computer Science 2023-08-01 Samuel Bucheli , Roman Kuznets , Thomas Studer

Sandqvist gave a proof-theoretic semantics (P-tS) for classical logic (CL) that explicates the meaning of the connectives without assuming bivalance. Later, he gave a semantics for intuitionistic propositional logic (IPL). While soundness…

Logic · Mathematics 2025-07-18 Alexander V. Gheorghiu

This paper introduces two sequent calculi for intuitionistic strong L\"ob logic ${\sf iSL}_\Box$: a terminating sequent calculus ${\sf G4iSL}_\Box$ based on the terminating sequent calculus ${\sf G4ip}$ for intuitionistic propositional…

Logic · Mathematics 2023-03-07 Iris van der Giessen , Rosalie Iemhoff
‹ Prev 1 4 5 6 7 8 10 Next ›