Related papers: Quantifier-free formulas and quantifier alternatio…
General relativity is a deterministic theory with non-fixed causal structure. Quantum theory is a probabilistic theory with fixed causal structure. In this paper we build a framework for probabilistic theories with non-fixed causal…
Prolog is a well known declarative programming language based on propositional Horn formulas. It is useful in various areas, including artificial intelligence, automated theorem proving, mathematical logic and so on. An active research area…
We present a new method for the quantization of totally constrained systems including general relativity. The method consists in constructing discretized theories that have a well defined and controlled continuum limit. The discrete…
It is informally understood that the purpose of modal type constructors in programming calculi is to control the flow of information between types. In order to lend rigorous support to this idea, we study the category of classified sets, a…
Quantum Field Theory (QFT) represents a vast generalization of Quantum Mechanics (QM), as it deals with systems that have an infinite number of degrees of freedom. The Stone-von Neumann theorem, which establishes the equivalence of…
A hypothetical exclusion principle for quantum particles is introduced that generalizes the exclusion and inclusion principles for fermions and bosons, respectively: the correlated exclusion principle. The sum-free condition for Schur…
Determining the validity of a quantified Boolean formula (QBF) is a PSPACE-complete problem with rich expressive power. Despite interest in efficient solvers, there is, compared to problems in NP, a lack of positive theoretical results, and…
The unification type of an equational theory is defined using a preorder on substitutions, called the instantiation preorder, whose scope is either restricted to the variables occurring in the unification problem, or unrestricted such that…
The main contribution of this work is the definition of a quantifier-free string theory T_1 suitable for formalizing ALOGTIME reasoning. After describing L_1 -- a new, simple, algebraic characterization of the complexity class ALOGTIME…
In the logical framework introduced by Grohe and Tur\'an (TOCS 2004) for Boolean classification problems, the instances to classify are tuples from a logical structure, and Boolean classifiers are described by parametric models based on…
We introduce a quantum analogue of classical first-order logic (FO) and develop a theory of quantum first-order logic as a basis of the productive discussions on the power of logical expressiveness toward quantum computing. The purpose of…
The notion of a categorical quotient can be generalized since its standard categorical concept does not recover the expected quotients in certain categories. We present a more general formulation in the form of $\mathcal{F}$-quotients in a…
Contents * Introduction -- Why $S^1$-extended phase space? -- Why central extensions of classical symmetries? * Central extension \Gt of a group $G$ -- Group cohomology -- Cohomology and contractions: Pseudo-cohomology -- Principal bundle…
We present a discrete model theory similar in structure to ordinary quantum mechanics, but based on a finite field instead of complex amplitudes. The interpretation of this theory involves only the "modal" concepts of possibility and…
An algebraic structure underlying the quantity calculus is proposed consisting in an algebraic fiber bundle, that is, a base structure which is a free Abelian group together with fibers which are one dimensional vector spaces, all of them…
We introduce syntactic modal operator $\BOX$ for \textit{being a thesis} into first-order logic. This logic is a modern realization of R. Carnap's old ideas on modality, as logical necessity (J. Symb. Logic, 1946) \cite{Ca46}. We place it…
Classical physics is reformulated as a constrained Hamiltonian system in the history phase space. Dynamics, i.e. the Euler-Lagrange equations, play the role of first-class constraints. This allows us to apply standard methods from the…
In deduction modulo, a theory is not represented by a set of axioms but by a congruence on propositions modulo which the inference rules of standard deductive systems---such as for instance natural deduction---are applied. Therefore, the…
A careful reexamination of the quantization of systems with first- and second-class constraints from the point of view of coherent-state phase-space path integration reveals several significant distinctions from more conventional…
Costello and Gwilliam have given both 1) a general definition of perturbative quantum gauge theory on a manifold M and 2) a construction of a factorization algebra of quantum observables assigned to every quantum gauge theory. In this…