Related papers: The diagonal lemma as the formalized Grelling para…
We propose a new version of generalized probabilistic propositional logic, namely, discrete-continuous logic (DCL) in which every generalized proposition (GP) is represented as 2x2 nondiagonal positive matrix with unit trace. We demonstrate…
The semantic paradoxes are associated with self-reference or referential circularity. However, there are infinitary versions of the paradoxes, such as Yablo's paradox, that do not involve this form of circularity. It remains an open…
The regular languages with a neutral letter expressible in first-order logic with one alternation are characterized. Specifically, it is shown that if an arbitrary $\Sigma_2$ formula defines a regular language with a neutral letter, then…
We give a geometric approach to the proof of the $\lambda$-lemma. In particular, we point out the role pseudoconvexity plays in the proof.
Using Heijenoort's unpublished generalized rules of quantification, we discuss the proof of Herbrand's Fundamental Theorem in the form of Heijenoort's correction of Herbrand's "False Lemma" and present a didactic example. Although we are…
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…
For half a century, authors have weakened the rule of necessitation in various more or less ad hoc ways in order to make inconsistent systems consistent. More recently, necessitation was weakened in a systematic way, not for the purpose of…
Linear logic has provided new perspectives on proof-theory, denotational semantics and the study of programming languages. One of its main successes are proof-nets, canonical representations of proofs that lie at the intersection between…
Boolos's proof of incompleteness is extended straightforwardly to yield simple ``diagonalization-free'' proofs of some classical limitative theorems of logic.
When aggregating logically interconnected judgments from $n$ agents, the result might be inconsistent with the logical connection. This inconsistency is known as the doctrinal paradox, which plays a central role in the field of judgment…
In this short note we give an alternative proof of Glivenko's Theorem, stating that a formula $\phi$ is provable in classical propositional logic if and only if $\neg\neg\phi$ is provable in intuitionistic propositional logic. We work in…
Logical reasoning is central to human cognition and intelligence. It includes deductive, inductive, and abductive reasoning. Past research of logical reasoning within AI uses formal language as knowledge representation and symbolic…
Isomorphism between formulae is defined with respect to categories formalizing equality of deductions in classical propositional logic and in the multiplicative fragment of classical linear propositional logic caught by proof nets. This…
Drinfeld's lemma is a powerful tool for splitting $\ell$-adic local systems defined over a product of connected schemes over a finite field. In this paper, we show that Drinfeld's lemma also holds true for algebraic stacks.
It is well-known that Choice and Regularity are independent of each other but have important common consequences of logical character (reflection principles, representations of classes by sets, etc.). We explain this phenomenon by isolating…
Whatever other beliefs there may remain for considering Cantor's diagonal argument as mathematically legitimate, there are three that, prima facie, lend it an illusory legitimacy; they need to be explicitly discounted appropriately. The…
Separation Logic is a widely used formalism for describing dynamically allocated linked data structures, such as lists, trees, etc. The decidability status of various fragments of the logic constitutes a long standing open problem. Current…
We give a direct and elementary proof of the theorem on formal functions by studying the behaviour of the Godement resolution of a sheaf of modules under completion.
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…
The liar paradox is widely seen as not a serious problem. I try to explain why this view is mistaken.