Related papers: Relevant First-Order Logic $LP^\#$ and Curry's Par…
Hardy-type paradoxes offer elegant, inequality-free proof of quantum contextuality. In this work, we introduce a unified logical formulation for general Hardy-type paradoxes, which we term logical Hardy-type paradoxes. We prove that for any…
Logic rules and inference are fundamental in computer science and have been studied extensively. However, prior semantics of logic languages can have subtle implications and can disagree significantly, on even very simple programs,…
Intuitionistic first-order logic extended with a restricted form of Markov's principle is constructive and admits a Curry-Howard correspondence, as shown by Herbelin. We provide a simpler proof of that result and then we study…
In 1957, Hans Lewy constructed a counterexample showing that very simple and natural differential equations can fail to have local solutions. A geometric interpretation and a generalization of this counterexample were given in 1960 by…
We will investigate proof-theoretic and linguistic aspects of first-order linear logic. We will show that adding partial order constraints in such a way that each sequent defines a unique linear order on the antecedent formulas of a sequent…
Strict-Tolerant Logic (ST) underpins naive theories of truth and vagueness (respectively including a fully disquotational truth predicate and an unrestricted tolerance principle) without jettisoning any classically valid laws. The classical…
In this paper, we study the Br\"{u}ck conjecture \cite{Bruck-1996} by interpreting it through solutions of first-order partial differential equations in several complex variables. Our results show that the Br\"{u}ck conjecture…
Starting with a likelihood or preference order on worlds, we extend it to a likelihood ordering on sets of worlds in a natural way, and examine the resulting logic. Lewis earlier considered such a notion of relative likelihood in the…
The so-called problem of grue was introduced by Nelson Goodman in 1954 as a "riddle" about induction, a riddle which has been widely thought to cast doubt on the validity and rationality of induction. That unnecessary doubt in turn is…
This reports introduces a novel sound and complete semantics for first order intuitionistic logic, in the framework of category theory and by the computational interpretation of the logic based on the so-called Curry-Howard isomorphism.…
The semantics for counterfactuals due to David Lewis has been challenged on the basis of unlikely, or impossible, events. Such events may skew a given similarity order in favour of those possible worlds which exhibit them. By updating the…
Hardy's paradox was originally presented as a demonstration, without inequalities, of the incompatibility between quantum mechanics and the hypothesis of local causality. Equipped with newly developed tools that allow for a quantitative…
Finding solution values for unknowns in Boolean equations was a principal reasoning mode in the Algebra of Logic of the 19th century. Schr\"oder investigated it as Aufl\"osungsproblem (solution problem). It is closely related to the modern…
Logical paradoxes and inconsistent information pose deep challenges in epistemology and the philosophy of logic. Classical systems typically handle contradictions only through external checks or by altering the logical framework, as in…
We extend answer set semantics to deal with inconsistent programs (containing classical negation), by finding a ``best'' answer set. Within the context of inconsistent programs, it is natural to have a partial order on rules, representing a…
Blocked clauses provide the basis for powerful reasoning techniques used in SAT, QBF, and DQBF solving. Their definition, which relies on a simple syntactic criterion, guarantees that they are both redundant and easy to find. In this paper,…
In the article 'Ordinal Logics and the Characterizations of the Informal Concept of Proof', Georg Kreisel poses the problem of assigning unique notations to recursive ordinals, and additionally suggests that the methods which are developed…
We study counting propositional logic as an extension of propositional logic with counting quantifiers. We prove that the complexity of the underlying decision problem perfectly matches the appropriate level of Wagner's counting hierarchy,…
We show that for any $i > 0$, it is decidable, given a regular language, whether it is expressible in the $\Sigma_i[<]$ fragment of first-order logic FO[<]. This settles a question open since 1971. Our main technical result relies on the…
I present a dialetheic solution to the Antinomy of the Liar and I evaluate the objection that, if the argument in Curry's paradox is valid, accepting this solution forces us to accept an analogous solution to Curry's, which I show to be…