Related papers: Recovering Quantum Logic within an Extended Classi…
Nonreflexive quantum mechanics is a formulation of quantum theory based on a non-classical logic termed \ita{nonreflexive logic} (a.k.a. `non-reflexive'). In these logics, the standard notion of identity, as encapsulated in classical logic…
This paper presents a sound, complete, and decidable analytic tableau system for the logic of evidence and truth \letf, introduced in Rodrigues, Bueno-Soler \& Carnielli (Synthese, DOI: 10.1007/s11229-020-02571-w, 2020). \letf\ is an…
A certain non-linear non-local substitution is shown to transform the action of the self-interacting quantum field to the free one. The functional integrals in both theories are equal to each other. However, the integrations are performed…
Involving only the measurements of commuting observables - the problem-setting and the corresponding solution - quantum algorithms should be subject to classical logic. This would allow flanking their customary quantum description with a…
We describe a scheme for constructing quantum mechanics in which a quantum system is considered as a collection of open classical subsystems. This allows using the formal classical logic and classical probability theory in quantum…
The model theory of a first-order logic called N^4 is introduced. N^4 does not eliminate double negations, as classical logic does, but instead reduces fourfold negations. N^4 is very close to classical logic: N^4 has two truth values;…
We introduce a formalism for the evaluation of counterfactual queries in the framework of quantum causal models, generalising Pearl's semantics for counterfactuals in classical causal models, thus completing the last rung in the quantum…
This paper gives a formulation of quantum logic in the abstract algebraic setting laid out by Dunn and Hardegree (2001). On this basis, it provides a comparative analysis of viable quantum logical bivalent semantics and their classical…
We extend classical Propositional Logic (PL) by adding a new primitive binary connective $\varphi|\psi$, intended to represent the "superposition" of sentences $\varphi$ and $\psi$, an operation motivated by the corresponding notion of…
This paper is concerned with the paraconsistent first-order logic LPQ$^{\supset,\mathsf{F}}$, Priest's LPQ enriched with an implication connective and a falsity constant. A sequent-style natural deduction proof system for this logic is…
Large language models (LLMs) have transformed natural language processing (NLP), enabling diverse applications by integrating large-scale pre-trained knowledge. However, their static knowledge limits dynamic reasoning over external…
Some notes about quantum physics, an interpretation if one wishes, are put forward, insisting on `closely following the mathematics/formalism, the `nuts and bolts of what quantum physics says'. These, basically well-known, issues seem to…
Any particular classical system and its quantum version are normally viewed as separate formulations that are strictly distinct. Our goal is to overcome the two separate languages and create a smooth and common procedure that provides a…
We show monistic realism consistent with quantum theory may be restored by extending the essential idea of relativity in such a way that every physical system is eligible, in principle, for an observing system. As a result, a common logical…
We develop a bottom-up approach to truth-value semantics for classical logic of partial terms based on equality and apply it to prove the conservativity of the addition of partial description and partial selection functions, independently…
In this thesis, we present two approaches to a rigorous mathematical and algorithmic foundation of quantitative and statistical inference in constraint-based natural language processing. The first approach, called quantitative constraint…
Large Language Models (LLMs) are predominantly governed by probabilistic frameworks in which the sum of outcome probabilities is constrained to unity. This architectural limitation, often imposed by Softmax layers, leads to a collapse of…
Classical computation, grounded in formal, logical systems, has been the engine of technological progress for decades, excelling at problems that can be described with unambiguous rules. This paradigm, however, leaves a vast ocean of human…
It is shown that quantum logic is a logic in the very same way in which classical logic is a logic. Soundness and completeness of both quantum and classical logics have been proved for novel lattice models that are not orthomodular and…
Non-classical generalizations of classical modal logic have been developed in the contexts of constructive mathematics and natural language semantics. In this paper, we discuss a general approach to the semantics of non-classical modal…