English
Related papers

Related papers: Quantifier-free formulas and quantifier alternatio…

200 papers

Modular localization is the concise conceptual formulation of causal localization in the setting of local quantum physics. Unlike QM it does not refer to individual operators but rather to ensembles of observables which share the same…

Mathematical Physics · Physics 2014-08-14 Bert Schroer

The recently introduced framework of Graded Quantitative Rewriting is an innovative extension of traditional rewriting systems, in which rules are annotated with degrees drawn from a quantale. This framework provides a robust foundation for…

Logic in Computer Science · Computer Science 2025-07-29 Mauricio Ayala-Rincón , Thaynara Arielly de Lima , Georg Ehling , Temur Kutsia

In a modular approach, we lift Hilbert-style proof systems for propositional, modal and first-order logic to generalized systems for their respective team-based extensions. We obtain sound and complete axiomatizations for the…

Logic in Computer Science · Computer Science 2018-03-28 Martin Lück

Propositional term modal logic is interpreted over Kripke structures with unboundedly many accessibility relations and hence the syntax admits variables indexing modalities and quantification over them. This logic is undecidable, and we…

Logic in Computer Science · Computer Science 2019-01-01 Anantha Padmanabha , R Ramanujam

The one-variable fragment of any first-order logic may be considered as a modal logic, where the universal and existential quantifiers are replaced by a box and diamond modality, respectively. In several cases, axiomatizations of algebraic…

Logic · Mathematics 2022-09-20 Petr Cintula , George Metcalfe , Naomi Tokuda

We argue that to solve the foundational problems of quantum theory one has to first understand what it means to quantize a classical system. We then propose a quantization method based on replacement of deterministic c-numbers by…

Quantum Physics · Physics 2015-06-05 Agung Budiyono

We present a straightforward embedding of quantified multimodal logic in simple type theory and prove its soundness and completeness. Modal operators are replaced by quantification over a type of possible worlds. We present simple…

Artificial Intelligence · Computer Science 2009-05-18 Christoph Benzmueller , Lawrence C. Paulson

Over the past two decades several fragments of first-order logic have been identified and shown to have good computational and algorithmic properties, to a great extent as a result of appropriately describing the image of the standard…

Logic in Computer Science · Computer Science 2017-03-08 Lidia Tendera

The nonclassicality of single-mode quantum states is studied in relation to the entanglement created by a beam splitter. It is shown that properly defined quantifications -- based on the quantum superposition principle -- of the amounts of…

Quantum Physics · Physics 2015-06-18 W. Vogel , J. Sperling

Quantitative algebras (QAs) are algebras over metric spaces defined by quantitative equational theories as introduced by the same authors in a related paper presented at LICS 2016. These algebras provide the mathematical foundation for…

Logic in Computer Science · Computer Science 2018-04-06 Radu Mardare , Prakash Panangaden , Gordon Plotkin

Many first-order equational theories, such as the theory of groups or boolean algebras, can be presented by a smaller set of axioms than the original one. Recent studies showed that a homological approach to equational theories gives us…

Logic in Computer Science · Computer Science 2026-03-31 Mirai Ikebuchi

We derive the category-theoretic backbone of quantum theory from a process ontology. More specifically, we treat quantum theory as a theory of systems, processes and their interactions. In this first part of a three-part overview, we first…

Quantum Physics · Physics 2016-05-30 Bob Coecke , Aleks Kissinger

We give a new proof of quantifier elimination in the theory of all ordered abelian groups in a suitable language. More precisely, this is only "quantifier elimination relative to ordered sets" in the following sense. Each definable set in…

Logic · Mathematics 2012-01-24 Raf Cluckers , Immanuel Halupczok

We study the computational complexity of certain integrable quantum theories in 1+1 dimensions. We formalize a model of quantum computation based on these theories. In this model, distinguishable particles start out with known momenta and…

Quantum Physics · Physics 2016-01-01 Saeed Mehraban

Goal-directed proof search in first-order logic uses meta-variables to delay the choice of witnesses; substitutions for such variables are produced when closing proof-tree branches, using first-order unification or a theory-specific…

Logic in Computer Science · Computer Science 2015-09-04 Damien Rouhling , Mahfuza Farooque , Stéphane Graham-Lengrand , Assia Mahboubi , Jean-Marc Notin

The satisfiability problem for First-order Modal Logic (\FOML) is undecidable even for simple fragments like having only unary predicates, two variables etc. Recently a new way to identify decidable fragments of \FOML has been introduced…

Logic in Computer Science · Computer Science 2025-06-03 Varad Joshi , Anantha Padmanabha

It is shown that background fields of a topological character usually introduced as such in compactified string theories correspond to quantum degrees of freedom which parametrise the freedom in choosing a representation of the zero mode…

High Energy Physics - Theory · Physics 2008-11-26 Jan Govaerts , Florian Payen

We present the model theoretic concepts that allow mathematics to be developed with the notion of the potential infinite instead of the actual infinite. The potential infinite is understood as a dynamic notion, being an indefinitely…

Logic · Mathematics 2022-12-16 Matthias Eberl

The uniform one-dimensional fragment of first-order logic was introduced a few years ago as a generalization of the two-variable fragment to contexts involving relations of arity greater than two. Quantifiers in this logic are used in…

Logic in Computer Science · Computer Science 2025-03-19 Oskar Fiuk , Emanuel Kieronski

Using the formalism of discrete quantum group gauge theory, one can construct the quantum algebras of observables for the Hamiltonian Chern-Simons model. The resulting moduli algebras provide quantizations of the algebra of functions on the…

q-alg · Mathematics 2008-02-03 Anton Yu. Alekseev , Volker Schomerus
‹ Prev 1 3 4 5 6 7 10 Next ›