相关论文: Boolos-style proofs of limitative theorems
We present a formalization of convex polyhedra in the proof assistant Coq. The cornerstone of our work is a complete implementation of the simplex method, together with the proof of its correctness and termination. This allows us to define…
This paper enlarges classical syllogistic logic with assertions having to do with comparisons between the sizes of sets. So it concerns a logical system whose sentences are of the following forms: {\sf All $x$ are $y$} and {\sf Some $x$ are…
In a modular approach, we lift Hilbert-style proof systems for propositional, modal and first-order logic to generalized systems for their respective team-based extensions. We obtain sound and complete axiomatizations for the…
This note is purely expository. The statement of the Gauss theorem on the constructibility of regular polygons by means of compass and ruler is simple and well-known. However, its proofs given in most textbooks rely upon much unmotivated…
We give four new proofs of the directed version of Brook's Theorem and an NP-completeness result.
We introduce the notion of limiting theories, giving examples and providing a sufficient condition under which the first order theory of a structure is the limit of the first order theories of a collection of substructures. We also give a…
Boolean calculus has been studied extensively in the past in the context of switching circuits, error-correcting codes etc. This work generalizes several approaches to defining a differential calculus for Boolean functions. A unified theory…
The standard reasoning problem, concept satisfiability, in the basic description logic ALC is PSPACE-complete, and it is EXPTIME-complete in the presence of unrestricted axioms. Several fragments of ALC, notably logics in the FL, EL, and…
Recently, arXiv:2312.16035 showed that all logics based on Boolean Normal monotonic three-valued schemes coincide with classical logic when defined using a strict-tolerant standard ($\mathbf{st}$). Conversely, they proved that under a…
A constructive proof of the Goedel-Rosser incompleteness theorem has been completed using the Coq proof assistant. Some theory of classical first-order logic over an arbitrary language is formalized. A development of primitive recursive…
We prove a generalization of Lopes's theorem, that is, of the converse of Brolin's theorem.
In this paper, we determine the complexity of the satisfiability problem for various logics obtained by adding numerical quantifiers, and other constructions, to the traditional syllogistic. In addition, we demonstrate the incompleteness of…
A probabilistic propositional logic, endowed with an epistemic component for asserting (non-)compatibility of diagonizable and bounded observables, is presented and illustrated for reasoning about the random results of projective…
We present a short and self-contained proof of the choosability version of Brooks' theorem.
We prove "untyping" theorems: in some typed theories (semirings, Kleene algebras, residuated lattices, involutive residuated lattices), typed equations can be derived from the underlying untyped equations. As a consequence, the…
We present a syntactic abstraction method to reason about first-order modal logics by using theorem provers for standard first-order logic and for propositional modal logic.
We formulate and prove finite dimensional analogs for the classical Balian-Low theorem, and for a quantitative Balian-Low type theorem that, in the case of the real line, we obtained in a previous work. Moreover, we show that these results…
A novel polynomial expansion method of symmetric Boolean functions is described. The method is efficient for symmetric Boolean function with small set of valued numbers and has the linear complexity for elementary symmetric Boolean…
The propositional logic is generalized on the real numbers field. the logical function with all properties of the classical probability function is obtained. The logical analog of the Bernoulli independent tests scheme is constructed. The…
This article discusses the logical errors in the liar paradox, G\"odel's incompleteness theorems, Russell's paradox, and the halting problem. In order to avoid these errors, a redefinition of logic has been presented, which is concluded as…