Related papers: Quantifier-free formulas and quantifier alternatio…
Categorical models of the exponential modality of linear logic will often, but not always, support an operation of differentiation. When they do, we speak of a monoidal differential modality; when they do not, we have merely a monoidal…
From a logical point of view, Stone duality for Boolean algebras relates theories in classical propositional logic and their collections of models. The theories can be seen as presentations of Boolean algebras, and the collections of models…
We provide a co-free construction which adds elementary structure to a primary doctrine. We show that the construction preserves comprehensions and all the logical operations which are in the starting doctrine, in the sense that it maps a…
This article fits in the area of research that investigates the application of topological duality methods to problems that appear in theoretical computer science. One of the eventual goals of this approach is to derive results in…
First order formulas in a relational signature can be considered as operations on the relations of an underlying set, giving rise to multisorted algebras we call first order algebras. We present universal axioms so that an algebra satisfies…
A co-valuation is, essentially, a minimal finite cover. We introduce a logic based on co-valuations, which play the role of valuations of free variables in classical first-order logic, and show that the fundamental tools of model theory --…
We introduce a new variant of dependence logic called Boolean dependence logic. In Boolean dependence logic dependence atoms are of the type =(x_1,...,x_n,\alpha), where \alpha is a Boolean variable. Intuitively, with Boolean dependence…
Some mathematical theories in physics justify their explanatory superiority over earlier formalisms by the clarity of their postulates. In particular, axiomatic reconstructions drive home the importance of the composition rule and the…
We contribute to the knowledge of the quantifier completions and their applications by using the language of doctrines. This algebraic presentation allows us to properly analyse the behaviour of the existential and universal quantifiers. We…
Second-order Boolean logic is a generalization of QBF, whose constant alternation fragments are known to be complete for the levels of the exponential time hierarchy. We consider two types of restriction of this logic: 1) restrictions to…
A formulation of quantum mechanics with additive and multiplicative (q-)difference operators instead of differential operators is studied from first principles. Borel-quantisation on smooth configuration spaces is used as guiding…
In this paper we we will argue against the orthodox definition of quantum entanglement which has been implicitly grounded on several widespread (metaphysical) presuppositions which have no relation whatsoever to the formalism of QM. We will…
Boolean function bi-decomposition is ubiquitous in logic synthesis. It entails the decomposition of a Boolean function using two-input simple logic gates. Existing solutions for bi-decomposition are often based on BDDs and, more recently,…
Rule-based classification models described in the language of logic directly predict boolean values, rather than modeling a probability and translating it into a prediction as done in statistical models. The vast majority of existing…
We study the logic obtained by endowing the language of first-order arithmetic with second-order measure quantifiers. This new kind of quantification allows us to express that the argument formula is true in a certain portion of all…
Divergences that arise in the quantization of scalar quantum field models by means of a lattice-space functional integration may be attributed to a single integration variable, and this fact is demonstrated by showing that if the integrand…
The classical mechanics of a finite number of degrees of freedom requires a symplectic structure on phase space C, but it is independent of any complex structure. On the contrary, the quantum theory is intimately linked with the choice of a…
A $\mu$-algebra is a model of a first order theory that is an extension of the theory of bounded lattices, that comes with pairs of terms $(f,\mu_{x}.f)$ where $\mu_{x}.f$ is axiomatized as the least prefixed point of $f$, whose axioms are…
We introduce first order alternating automata, a generalization of boolean alternating automata, in which transition rules are described by multisorted first order formulae, with states and internal variables given by uninterpreted…
We consider a first-order logic for the integers with addition. This logic extends classical first-order logic by modulo-counting, threshold-counting and exact-counting quantifiers, all applied to tuples of variables (here, residues are…