Related papers: Another Combination of Classical and Intuitionisti…

My purpose is to examine some concepts of mathematical logic, which have been studied by Carlo Cellucci. Today the aim of classical mathematical logic is not to guarantee the certainty of mathematics, but I will argue that logic can help us…

Timothy Williamson has recently argued that the applicability of classical mathematics in the natural and social sciences raises a problem for the endorsement, in non-mathematical domains, of a wide range of non-classical logics. We first…

Classical evaluations of configurations of intertwined quantum contexts induce relations, such as true-implies-false, true-implies-true, but also nonseparability among the input and output terminals. When combined, these exploitable…

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…

Cirquent calculus is a new proof-theoretic and semantic framework, whose main distinguishing feature is being based on circuits, as opposed to the more traditional approaches that deal with tree-like objects such as formulas or sequents.…

In this paper we present a formalization of Intuitionistic Propositional Logic in the Lean proof assistant. Our approach focuses on verifying two completeness proofs for the studied logical system, as well as exploring the relation between…

We discuss an ongoing line of research in the relational (non topological) semantics of non-distributive logics. The developments we consider are technically rooted in dual characterization results and insights from unified correspondence…

We investigate cut-elimination and cut-simulation in impredicative (higher-order) logics. We illustrate that adding simple axioms such as Leibniz equations to a calculus for an impredicative logic -- in our case a sequent calculus for…

This literature review discovers an implementation of formal logic systems in cyber security by enhancing access control models. We explore the characteristics of the existing access control theories, their limitations and how classical…

In this paper we analyse logic of false belief in intuitionistic setting. This logic, studied in its classical version by Steinsvold, Fan, Gilbert and Venturi, describes the following situation: a formula F is not satisfied in a given…

We study the expressive power of fragments of inclusion and independence logic defined either by restricting the number of universal quantifiers or the arity of inclusion and independence atoms in formulas. Assuming the so-called lax…

Ramsey Theorem [6] for pairs is intuitionistically but not classically provable: it is equivalent to a subclassical principle [2]. In this note we show that Ramsey may be restated in an intuitionistically provable form, which is informative…

A semantics is given to possibilistic logic, a logic that handles weighted classical logic formulae, and where weights are interpreted as lower bounds on degrees of certainty or possibility, in the sense of Zadeh's possibility theory. The…

We propose a semantic representation of the standard quantum logic QL within a classical, normal modal logic, and this via a lattice-embedding of orthomodular lattices into Boolean algebras with one modal operator. Thus our classical logic…

This paper studies the relationship between labelled and nested calculi for propositional intuitionistic logic, first-order intuitionistic logic with non-constant domains and first-order intuitionistic logic with constant domains. It is…

In this paper we will see deductive systems for classical propositional and predicate logic in the calculus of structures. Like sequent systems, they have a cut rule which is admissible. In addition, they enjoy a top-down symmetry and some…

Plausible reasoning concerns situations whose inherent lack of precision is not quantified; that is, there are no degrees or levels of precision, and hence no use of numbers like probabilities. A hopefully comprehensive set of principles…

Type-free systems of logic are designed to consistently handle significant instances of self-reference. Some consistent type-free systems also have the feature of allowing the sort of general abstraction or comprehension principle that…

We consider (finitary, propositional) logics through the original use of Category Theory: the study of the "sociology of mathematical objects", aligning us with a recent, and growing, trend of study logics through its relations with other…

C. I. Lewis invented modern modal logic as a theory of "strict implication". Over the classical propositional calculus one can as well work with the unary box connective. Intuitionistically, however, the strict implication has greater…