Related papers: A Galois connection between classical and intuitio…
We introduce a logic modelling some aspects of the behaviour of the measurement process, in such a way that no direct mention of quantum states is made, thus avoiding the problems associated to this rather evasive notion. We then study some…
Intuitionistic belief has been axiomatized by Artemov and Protopopescu as an extension of intuitionistic propositional logic by means of the distributivity scheme K, and of co-reflection $A\rightarrow\Box A$. This way, belief is interpreted…
A connection between the Galois-theoretic approach to semi-abelian homology and the homological closure operators is established. In particular, a generalised Hopf formula for homology is obtained, allowing the choice of a new kind of…
A variety of problems emerged investigating electronic circuits, computer devices and cellular automata motivated a number of attempts to create a differential and integral calculus for Boolean functions. In the present article, we extend…
The notion of class is ubiquitous in computer science and is central in many formalisms for the representation of structured knowledge used both in knowledge representation and in databases. In this paper we study the basic issues…
Given a quantum Hamiltonian, we explain how the dynamical properties of the underlying classical system affect the behaviour of quantum eigenstates in the semi-classical limit. We study this problem via the notion of semiclassical measures.…
We introduce and develop propositional continuous intuitionistic logic and propositional continuous affine logic via complete algebraic semantics. Our approach centres on AC-algebras, which are algebras $USC(\mathcal{L})$ of sup-preserving…
We establish restrictions on the Hilbert function of standard graded Gorenstein algebras with only quadratic relations. Furthermore, we pose some intriguing conjectures and provide evidence for them by proving them in some cases using a…
In general, providing an axiomatization for an arbitrary logic is a task that may require some ingenuity. In the case of logics defined by a finite logical matrix (three-valued logics being a particularly simple example), the generation of…
We propose a categorial grammar based on classical multiplicative linear logic. This can be seen as an extension of abstract categorial grammars (ACG) and is at least as expressive. However, constituents of {\it linear logic grammars (LLG)}…
We propose four axiomatic systems for intuitionistic linear temporal logic and show that each of these systems is sound for a class of structures based either on Kripke frames or on dynamic topological systems. Our topological semantics…
In this paper we will see deductive systems for classical propositional and predicate logic in the calculus of structures. Like sequent systems, they have a cut rule which is admissible. In addition, they enjoy a top-down symmetry and some…
We introduce FIK, a natural intuitionistic modal logic specified by Kripke models satisfying the condition of forward confluence. We give a complete Hilbert-style axiomatization of this logic and propose a bi-nested calculus for it. The…
We determine the Hilbert series of some classes of ideals generated by generic forms of degree two and three, and investigate the difference to the Hilbert series of ideals generated by powers of linear generic forms of the corresponding…
There is a wide range of modal logics whose semantics goes beyond relational structures, and instead involves, e.g., probabilities, multi-player games, weights, or neighbourhood structures. Coalgebraic logic serves as a unifying semantic…
Statistical learning and logical reasoning are two major fields of AI expected to be unified for human-like machine intelligence. Most existing work considers how to combine existing logical and statistical systems. However, there is no…
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;…
The probabilistic description of finite classical systems often leads to linear kinetic equations. A set of physically motivated mathematical requirements is accordingly formulated. We show that it necessarily implies that solutions of such…
In the same sense as classical logic is a formal theory of truth, the recently initiated approach called computability logic is a formal theory of computability. It understands (interactive) computational problems as games played by a…
The ability to derive underlying principles from a handful of observations and then generalize to novel situations -- known as inductive reasoning -- is central to human intelligence. Prior work suggests that language models (LMs) often…