Related papers: Epsilon Theorems in Intermediate Logics
A logic satisfies the interpolation property provided that whenever a formula {\Delta} is a consequence of another formula {\Gamma}, then this is witnessed by a formula {\Theta} which only refers to the language common to {\Gamma} and…
One advantage of paraconsistent logic is that it can deal with inconsistencies without making the system trivial. However, unlike classical propositional calculus, its deductive system is limited, and the meaning of paraconsistent negation…
Possibility theory offers a framework where both Lehmann's "preferential inference" and the more productive (but less cautious) "rational closure inference" can be represented. However, there are situations where the second inference does…
Formal logic has often been seen as uniquely placed to analyze mathematical argumentation. While formal logic is certainly necessary for a complete understanding of mathematical practice, it is not sufficient. Important aspects of…
This paper extends the literature on the strict-tolerant logical approach by applying its methods to intuitionistic and minimal logic. In short, the strict-tolerant approach modifies the usual notion of logical consequence by stipulating…
The usual $\epsilon,\delta$-definition of the limit of a function (whether presented at a rigorous or an intuitive level) requires a "candidate $L$" for the limit value. Thus, we have to start our first calculus course with "guessing"…
Several different proof translations exist between classical and intuitionistic logic (negative translations), and intuitionistic and linear logic (Girard translations). Our aims in this paper are (1) to consider extensions of…
G\"odel modal logics can be seen as extenions of intutionistic modal logics with the prelinearity axiom. In this paper we focus on the algebraic and relational semantics for G\"odel modal logics that leverages on the duality between finite…
This work contributes to the theory of judgment aggregation by discussing a number of significant non-classical logics. After adapting the standard framework of judgment aggregation to cope with non-classical logics, we discuss in…
Contrary to classical semantics, the disjunction of two experimental propositions relating to pure states of a quantum system ("quantum propositions" for short) can be true even in the case where neither disjunct is true. This suggests that…
One way of proving theorems in modal logics is translating them into the predicate calculus and then using conventional resolution-style theorem provers. This approach has been regarded as inappropriate in practice, because the resulting…
Classically, two propositions are logically equivalent precisely when they are true under the same logical valuations. Also, two logical valuations are distinct if, and only if, there is a formula that is true according to one valuation,…
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…
We investigate a non-classical version of linear temporal logic whose propositional fragment is G\"odel--Dummett logic (which is well known both as a superintuitionistic logic and a t-norm fuzzy logic). We define the logic using two natural…
Continuous first-order logic is used to apply model-theoretic analysis to analytic structures (e.g. Hilbert spaces, Banach spaces, probability spaces, etc.). Classical computable model theory is used to examine the algorithmic structure of…
Propositional logic serves as a fundamental cornerstone in mathematical logic. This paper delves into a semiring characterization of propositional logic, employing the Gr\"oebner-Shirshov basis theory to furnish an algebraic framework for…
Intuitively, the more powerful a theory is, the greater the variety and quantity of ideas can be expressed through its formal language. Therefore, when comparing two theories concerning the same subject, it seems only reasonable to compare…
We consider the standard quantum logic ${\mathcal L}(H)$ associated to a complex Hilbert space $H$, i.e. the lattice of closed subspaces of $H$ together with the orthogonal complementation. The orthogonality and compatibility relations are…
This introduction begins with a section on fundamental notions of mathematical logic, including propositional logic, predicate or first-order logic, completeness, compactness, the L\"owenheim-Skolem theorem, Craig interpolation, Beth's…
Propositional term modal logic is interpreted over Kripke structures with unboundedly many accessibility relations and hence the syntax admits variables indexing modalities and quantification over them. This logic is undecidable, and we…