English
Related papers

Related papers: The two halves of disjunctive correctness

200 papers

We discuss the application of the determinantal method to the proof of the Riemann hypothesis. We start from the fact that, if a certain doubly infinite set of determinants are all positive, then the hypothesis is true. This approach…

Number Theory · Mathematics 2011-11-07 John Nuttall

A logic-enriched type theory (LTT) is a type theory extended with a primitive mechanism for forming and proving propositions. We construct two LTTs, named LTTO and LTTO*, which we claim correspond closely to the classical predicative…

Logic in Computer Science · Computer Science 2010-08-19 Robin Adams , Zhaohui Luo

In this paper, we propose a comprehensive study of second-order consistencies (i.e., consistencies identifying inconsistent pairs of values) for constraint satisfaction. We build a full picture of the relationships existing between four…

Artificial Intelligence · Computer Science 2014-01-17 Christophe Lecoutre , Stephane Cardon , Julien Vion

The four-valued semantics of Belnap--Dunn logic, consisting of the truth values True, False, Neither, and Both, gives rise to several non-classical logics depending on which feature of propositions we wish to preserve: truth, non-falsity,…

Logic · Mathematics 2021-11-22 Adam Přenosil

This paper studies axioms for nonmonotonic consequences from a semantics-based point of view, focusing on a class of mathematical structures for reasoning about partial information without a predefined syntax/logic. This structure is called…

Logic in Computer Science · Computer Science 2007-05-23 Guo-Qiang Zhang

Glivenko's theorem says that, in propositional logic, classical provability of a formula entails intuitionistic provability of double negation of that formula. We generalise Glivenko's theorem from double negation to an arbitrary nucleus,…

Logic in Computer Science · Computer Science 2021-12-30 Giulio Fellin , Peter Schuster

We introduce the concept of disjunctive sum of squares for certifying nonnegativity of polynomials. Unlike the popular sum of squares approach where nonnegativity is certified by a single algebraic identity, the disjunctive sum of squares…

Optimization and Control · Mathematics 2026-05-28 Amir Ali Ahmadi , Sanjeeb Dash , Yixuan Hua , Bartolomeo Stellato

We prove a biadjoint triangle theorem and its strict version, which are $2$-dimensional analogues of the adjoint triangle theorem of Dubuc. Similarly to the $1$-dimensional case, we demonstrate how we can apply our results to get the…

Category Theory · Mathematics 2019-02-05 Fernando Lucatelli Nunes

In many real-life settings, agents must navigate dynamic environments while reasoning under incomplete information and acting on a corpus of unstable, context-dependent, and often conflicting norms. We introduce a general, non-modal,…

Logic in Computer Science · Computer Science 2025-12-23 Mario Piazza , Andrea Sabatini

It is known that the set of tautologies of second order intuitionistic propositional logic, $\mathrm{IPC} 2$, is undecidable. Here, we prove that the sets of formulas of $\mathrm{IPC} 2$ which are true in the algebra of open subsets of…

Logic · Mathematics 2016-12-22 Konrad Zdanowski

This draft introduces the technical machinery of a semantic framework for potentialist truthmaking based on our innovation of intentic states, which are structured partial models accounting for our distinction between non-hypothetical and…

Logic in Computer Science · Computer Science 2026-02-05 Paul Gorbow

Let $A$ be a set of natural numbers. A set $B$, a set of natural numbers, is said to be an additive complement of the set $A$ if all sufficiently large natural numbers can be represented in the form $x+y$, where $x\in A$ and $y\in B$. This…

Number Theory · Mathematics 2024-02-06 Mohan , Bhuwanesh Rao Patil , Ram Krishna Pandey

This paper explores goal-directed proof search in first-order multi-modal logic. The key issue is to design a proof system that respects the modularity and locality of assumptions of many modal logics. By forcing ambiguities to be…

Logic in Computer Science · Computer Science 2007-05-23 Matthew Stone

We introduce a coinductive version of the well-foundedness of N that is used in our proof within minimal logic of the constructive counterpart CLNP to the standard least number principle LNP. According to CLNP, an inhabited complemented…

Logic · Mathematics 2025-07-02 Iosif Petrakis

In this paper I show, with a rich and systematized diet of examples, that many contra-classical logics can be presented as variants of FDE, obtained by modifying at least one of the truth or falsity conditions of some connective. Then I…

Logic in Computer Science · Computer Science 2022-04-15 Luis Estrada-González

The general concept of nonlinear self-adjointness of differential equations is introduced. It includes the linear self-adjointness as a particular case. Moreover, it embraces the strict self-adjointness and quasi self-adjointness introduced…

Mathematical Physics · Physics 2015-05-28 Nail H. Ibragimov

We investigate the decidability and computational complexity of (deductive) conservative extensions in fragments of first-order logic (FO), with a focus on the two-variable fragment FO$^2$ and the guarded fragment GF. We prove that…

Logic in Computer Science · Computer Science 2017-05-30 Jean Christoph Jung , Carsten Lutz , Mauricio Martel , Thomas Schneider , Frank Wolter

Sandqvis's semantics for classical logic without bivalence resolves the question of an anti-realist account of classical reasoning after Dummett. This paper applies the framework to the essential questions of metamathematics. The system…

Logic · Mathematics 2026-03-09 Alexander V. Gheorghiu

The paper is a contribution both to the theoretical foundations and to the actual construction of efficient automatizable proof procedures for non-classical logics. We focus here on the case of finite-valued logics, and exhibit: (i) a…

Logic in Computer Science · Computer Science 2014-08-19 Carlos Caleiro , João Marcos , Marco Volpe

In this study, linear second-order conformable differential equations using a proportional derivative are shown to be formally self-adjoint equations with respect to a certain inner product and the associated self-adjoint boundary…

Classical Analysis and ODEs · Mathematics 2016-07-26 Douglas R. Anderson