相关论文: Boolos-style proofs of limitative theorems
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…
In this paper we prove that three of the main propositional logics of dependence (including propositional dependence logic and inquisitive logic), none of which is structural, are structurally complete with respect to a class of…
The aim of this article is to promote the use of probabilistic methods in the study of problems in mathematical general relativity. Two new and simple singularity theorems, whose features are different from the classical singularity…
Using recent results in topos theory, two systems of higher-order logic are shown to be complete with respect to sheaf models over topological spaces---so-called ``topological semantics''. The first is classical higher-order logic, with…
A Henkin-style proof of completeness of first-order classical logic is given with respect to a very small set (notably missing cut rule) of Genzten deduction rules for intuitionistic sequents. Insisting on sparing on derivation rules,…
A theorem, usually attributed to Barr, yields that (A) geometric implications deduced in classical L_{\infty\omega} logic from geometric theories also have intuitionistic proofs. Barr's theorem is of a topos-theoretic nature and its proof…
We study a conservative extension of classical propositional logic distinguishing between four modes of statement: a proposition may be affirmed or denied, and it may be strong or classical. Proofs of strong propositions must be…
The famous G\"odel incompleteness theorem says that for every sufficiently rich formal theory (containing formal arithmetic in some natural sense) there exist true unprovable statements. Such statements would be natural candidates for being…
We consider extensions of monadic second order logic over $\omega$-words, which are obtained by adding one language that is not $\omega$-regular. We show that if the added language $L$ has a neutral letter, then the resulting logic is…
This work, shows how propositional resolution can be generalized to obtain a resolution proof system for constrained pseudo-propositional logic (CPPL), which is an extension resulted from inserting the natural numbers with few constraints…
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 define a fragment of propositional logic where isomorphic propositions, such as $A\land B$ and $B\land A$, or $A\Rightarrow (B\land C)$ and $(A\Rightarrow B)\land(A\Rightarrow C)$ are identified. We define System I, a proof language for…
A completeness theorem is proved involving a system of integro-differential equations with some $\lambda$-depending boundary conditions. Also some sufficient conditions for the root functions to form a Riesz basis are established.
Cabello proved Bell's theorem without using inequalities. A loophole of Cabello's proof is pointed out in this work.
We present an illative system I_s of classical higher-order logic with subtyping and basic inductive types. The system I_s allows for direct definitions of partial and general recursive functions, and provides means for handling functions…
In this paper, we propose a generalization of Continuous Logic ([BBHU08]) where the distances take values in suitable co-quantales (in the way as it was proposed in [Fla97]). By assuming suitable conditions (e.g., being co-divisible,…
The example of the calculus is used to explain how simple, practical math was made enormously complex by imposing on it the Western religiously-colored notion of mathematics as "perfect". We describe a pedagogical experiment to make math…
Elimination of quantifiers is shown to fail dramatically for a group of well-known mathematical theories (classically enjoying the property) against a wide range of relevant logical backgrounds. Furthermore, it is suggested that only by…
In continuous logic, there are plenty of examples of interesting stable metric structures. However, on the other side of the SOP line, there are only a few metric structures where order is relevant, and orders often appear in different…
We study cut elimination for a multifocused variant of full linear logic in the sequent calculus. The multifocused normal form of proofs yields problems that do not appear in a standard focused system, related to the constraints in grouping…