English
Related papers

Related papers: A proof-theoretical approach to some extensions of…

200 papers

A first-order logic with quantum variables is needed as an assertion language for specifying and reasoning about various properties (e.g. correctness) of quantum programs. Surprisingly, such a logic is missing in the literature, and the…

Logic in Computer Science · Computer Science 2022-05-06 Mingsheng Ying

The paper is concerned with the unsteady solutions to the model of mutually penetrating continua and quasilinear hyperbolic modification of the Burgers equation (QHMB). The studies were focused on the peculiar solutions of models in…

Pattern Formation and Solitons · Physics 2017-08-29 O. Makarenko , A. Popov , S. Skurativskyi

Propositional type theory, first studied by Henkin, is the restriction of simple type theory to a single base type that is interpreted as the set of the two truth values. We show that two constants (falsity and implication) suffice for…

Logic in Computer Science · Computer Science 2010-01-25 Mark Kaminski , Gert Smolka

Using the Kleisi category of the Giry monad the deterministic existential and universal quantifiers are generalized to incorporate nondeterminism. These probabilistic quantifiers are quantified over the points of the category which are…

Probability · Mathematics 2012-08-15 Kirk Sturtz

This article is the first in a series of three papers, whose scope is to give new proofs to the well known theorems of Calder\'{o}n, Coifman, McIntosh and Meyer. Here we treat the case of the first commutator and some of its…

Classical Analysis and ODEs · Mathematics 2012-01-19 Camil Muscalu

In the context of orientable circuits and subcomplexes of these as representing certain singular spaces, we consider characteristic class formulas generalizing those classical results as seen for the Riemann-Hurwitz formula for regulating…

Algebraic Topology · Mathematics 2017-08-25 James F. Glazebrook , Alberto Verjovsky

In the first paper of this two part communication, we solved in a unified framework a variety of two terminal source coding problems with noncooperative encoders, thereby consolidating works of Shannon, Slepian-Wolf, Wyner,…

Information Theory · Computer Science 2007-07-13 Soumya Jana

We characterize the languages in the individual levels of the quantifier alternation hierarchy of first-order logic with two variables by identities. This implies decidability of the individual levels. More generally we show that the…

Logic in Computer Science · Computer Science 2012-05-23 Andreas Krebs , Howard Straubing

The standard postulates of quantum theory can be divided into two groups: the first one characterizes the structure and dynamics of pure states, while the second one specifies the structure of measurements and the corresponding…

Quantum Physics · Physics 2017-07-18 Thomas D. Galley , Lluis Masanes

Motivated by previous work leveraging factorizations of second- and fourth-order differential operators, a general integral inequality involving higher order derivatives is proven by elementary means. It is then shown how this framework…

Classical Analysis and ODEs · Mathematics 2025-09-19 Bart Rosenzweig , Jonathan Stanfill

Derived brackets as introduced and studied by Kosmann-Schwarzbach and Voronov are a powerful tool for describing and understanding infinitesimal symmetry actions relevant in physics. Roytenberg and Weinstein showed that this continues to…

High Energy Physics - Theory · Physics 2018-03-06 Andreas Deser , Christian Saemann

The semantics of determiner phrases, be they definite de- scriptions, indefinite descriptions or quantified noun phrases, is often as- sumed to be a fully solved question: common nouns are properties, and determiners are generalised…

Computation and Language · Computer Science 2016-03-02 Christian Retoré

Recent improvement on Tarski's procedure for quantifier elimination in the first order theory of real numbers makes it feasible to solve small instances of the following problems completely automatically: 1. listing all equality and…

Artificial Intelligence · Computer Science 2013-01-30 Dan Geiger , Christopher Meek

We find that second order quantification is problematic when a quantified concept variable is supposed to function predicatively. This issue is analyzed and it is shown that a constructive interpretation of the falling under relation…

Logic · Mathematics 2013-12-13 Nik Weaver

We deal with the monadic (second-order) theory of order. We prove all known results in a unified way, show a general way of reduction, prove more results and show the limitation on extending them. We prove (CH) that the monadic theory of…

Logic · Mathematics 2023-05-02 Saharon Shelah

We present new preservation theorems that semantically characterize the $\exists^k \forall^*$ and $\forall^k \exists^*$ prefix classes of first order logic, for each natural number $k$. Unlike preservation theorems in the literature that…

Logic in Computer Science · Computer Science 2013-06-18 Abhisekh Sankaran , Bharat Adsul , Supratik Chakraborty

In this article we present a natural generalization of Newton's Second Law valid in field theory, i.e., when the parameterized curves are replaced by parameterized submanifolds of higher dimension. For it we introduce what we have called…

Mathematical Physics · Physics 2018-11-14 Ricardo J. Alonso-Blanco , Jesús Muñoz-Díaz

The irreducible unitary representations of the Banach Lie group $U_0(\H)$ (which is the norm-closure of the inductive limit $\cup_k U(k)$) of unitary operators on a separable Hilbert space $\H$, which were found by Kirillov and Ol'shanskii,…

High Energy Physics - Theory · Physics 2007-05-23 N. P. Landsman

We define a set of "second-order" L^(2)-signature invariants for any algebraically slice knot. These obstruct a knot's being a slice knot and generalize Casson-Gordon invariants, which we consider to be "first-order signatures". As one…

Geometric Topology · Mathematics 2010-04-06 Tim Cochran , Shelly Harvey , Constance Leidy

We consider an extension of first-order logic with a recursion operator that corresponds to allowing formulas to refer to themselves. We investigate the obtained language under two different systems of semantics, thereby obtaining two…

Logic · Mathematics 2022-07-18 Reijo Jaakkola , Antti Kuusisto