Related papers: Quantifier Reasoning and Multiple Generality in Ar…
We present new results on finite satisfiability of logics with counting and arithmetic. One result is a tight bound on the complexity of satisfiability of logics with so-called local Presburger quantifiers, which sum over neighbors of a…
Contemporary semantic description of logic is based on the ontology of all possible interpretations, an insufficiently clear metaphysical concept. In this article, logic is described as the internal organization of language. Logical…
Logicians study and apply a multiplicity of various logical systems. Consequently, there is necessity to build foundations and common grounds for all these systems. This is done in metalogic. Like metamathematics studies formalized…
Theories of decoherence come in two flavors---Platonic and Aristotelian. Platonists grant ontological primacy to the concepts and mathematical symbols by which we describe or comprehend the physical world. Aristotelians grant it to the…
In Aristotelian logic, categorical propositions are divided in Universal Affirmative, Universal Negative, Particular Affirmative and Particular Negative. Possible relations between two of the mentioned type of propositions are encoded in…
Some common fallacies about fundamental themes of Logic are exposed: the First and Second incompleteness Theorem interpretations, Chaitin's various superficialities and the usual classification of the axiomatic Theories in function of its…
In the context of large language models (LLMs), current advanced reasoning methods have made impressive strides in various reasoning tasks. However, when it comes to logical reasoning tasks, major challenges remain in both efficacy and…
Quantum logic has been introduced by Birkhoff and von Neumann as an attempt to base the logical primitives, the propositions and the relations and operations among them, on quantum theoretical entities, and thus on the related empirical…
The (meta)logic underlying classical theory of computation is Boolean (two-valued) logic. Quantum logic was proposed by Birkhoff and von Neumann as a logic of quantum mechanics more than sixty years ago. The major difference between Boolean…
We consider categorical logic on the category of Hilbert spaces. More generally, in fact, any pre-Hilbert category suffices. We characterise closed subobjects, and prove that they form orthomodular lattices. This shows that quantum logic is…
This paper revisits the foundations of mathematical proof through the lens of Aristotle's threefold conception of truth: sensory evidence, axiomatic definition, and syllogistic deduction. I argue that modern mathematics has too often…
We offer a view of mathematics as an experimental science where axioms play the role of foundational theories like general relativity and quantum mechanics in physics. Under this view, axioms are provisional and inferred from experience…
Traditional cognitive science rests on a foundation of classical logic and probability theory. This foundation has been seriously challenged by several findings in experimental psychology on human decision making. Meanwhile, the formalism…
We combine the concepts of modal logics and many-valued logics in a general and comprehensive way. Namely, given any finite linearly ordered set of truth values and any set of propositional connectives defined by truth tables, we define the…
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…
Intuitionistic Propositional Logic is proved to be an infinitely many valued logic by Kurt G\"odel (1932), and it is proved by Stanis{\l}aw Ja\'skowski (1936) to be a countably many valued logic. In this paper, we provide alternative proofs…
Doubts are raised concerning the usual interpretation of the alleged failure, by quantum mechanics, of the distributive law of classical logic. The difficulty raised by incompatible sets of observables is overcome within an epistemic…
We introduce a variation on Barthe et al.'s higher-order logic in which formulas are interpreted as predicates over open rather than closed objects. This way, concepts which have an intrinsically functional nature, like continuity,…
Mathematics cannot anymore be assimilated to a linguistic game, where formal proofs are strongly differentiated with conjectural thinking, without building any category of knowledge to understand the passage (Wittgenstein's gist). Nowadays,…
This paper explores proof-theoretic semantics, a formal approach to inferential semantics. It derives sentence meaning from formalized proofs, building upon Gentzen and Prawitz's work. The study addresses challenges in understanding how…