English
Related papers

Related papers: Two preservation theorems

200 papers

In this paper we give an ordinal analysis of the theory of second order arithmetic. We do this by working with proof trees -- that is, "deductions" which may not be well-founded. Working in a suitable theory, we are able to represent…

Logic · Mathematics 2024-03-27 Henry Towsner

Recently the second author introduced combinatorial principles that characterize supercompactness for inaccessible cardinals but can also hold true for small cardinals. We prove that the proper forcing axiom PFA implies these principles…

Logic · Mathematics 2010-12-10 Matteo Viale , Christoph Weiß

In the paradigmatic example of quantum measurements, whenever one measures a system which starts in a superposition of two states of a conserved quantity, it jumps to one of the two states, implying different final values for the quantity…

Quantum Physics · Physics 2025-07-30 Daniel Collins , Sandu Popescu

An extension of the Wigner-Araki-Yanase theorem to multiplicative conserved quantities is presented and approximate versions of the theorem are discussed.

Quantum Physics · Physics 2007-07-31 Bernhard K. Meister

Noether's theorem and the invariances of the Willmore functional are used to derive conservation laws that are satisfied by the critical points of the Willmore energy subject to generic constraints. We recover in particular previous results…

Differential Geometry · Mathematics 2014-09-25 Yann Bernard

In this paper, we prove a fine condensation theorem. This is quite similar to condensation theorems for pure extender mice in the literature, except that condensation for iteration strategies has been added to the mix.

Logic · Mathematics 2023-08-25 John Steel , Nam Trang

We consider extensions of the language of Peano arithmetic by transfinitely iterated truth definitions satisfying uniform Tarskian biconditionals. Without further axioms, such theories are known to be conservative extensions of the original…

Logic · Mathematics 2019-10-31 Lev D. Beklemishev , Fedor N. Pakhomov

Conservation laws are discussed in conjunction with quantum-mechanical indeterminacies of the corresponding observables. The considered examples show that the connections between energy and its indeterminacy may be quite intricate. The…

General Physics · Physics 2022-09-15 Moses Fayngold

We provide elementary algorithms for two preservation theorems for first-order sentences (FO) on the class \^ad of all finite structures of degree at most d: For each FO-sentence that is preserved under extensions (homomorphisms) on \^ad, a…

Logic in Computer Science · Computer Science 2017-01-11 Frederik Harwath , Lucas Heimberg , Nicole Schweikardt

This work formulates and gives grounds for general principles and theorems that question the energy function doctrine and its quantum version as a genuine law of nature without borders of adequacy. The emphasis is on the domain where the…

General Physics · Physics 2011-09-23 V. E. Shapiro

We investigate a generalization of the {\L}o\'s-Tarski preservation theorem via the semantic notion of \emph{preservation under substructures modulo $k$-sized cores}. It was shown earlier that over arbitrary structures, this semantic notion…

Logic in Computer Science · Computer Science 2014-01-24 Abhisekh Sankaran , Bharat Adsul , Supratik Chakraborty

We determine the proof-theoretic strength of the principle of countable saturation in the context of the systems for nonstandard arithmetic introduced in our earlier work.

Logic · Mathematics 2016-05-20 B. van den Berg , E. M. Briseid , P. Safarik

Certain transformations of isolated physical systems underlying various conservation laws in physics are noted. As regards each of these transformations, there is a theoretical action that is equivalent to a matched physical action on the…

General Physics · Physics 2007-05-23 D. M. Snyder

The forcing theorem is the most fundamental result about set forcing, stating that the forcing relation for any set forcing is definable and that the truth lemma holds, that is everything that holds in a generic extension is forced by a…

Logic · Mathematics 2017-10-31 Peter Holy , Regula Krapf , Philipp Lücke , Ana Njegomir , Philipp Schlicht

We establish the equations which translate a conservation law for the problem of the seismic response of an above-ground structure (e.g., building, hill or mountain) of arbitrary shape and inquire whether both the implicit (formal) and…

Geophysics · Physics 2020-01-22 Armand Wirgin

Looking at some monoids and (semi)rings (natural numbers, integers and p-adic integers), and more generally, residually finite algebras (in a strong sense), we prove the equivalence of two ways for a function on such an algebra to behave…

Logic in Computer Science · Computer Science 2020-04-14 Patrick Cegielski , Serge Grigorieff , Irene Guessarian

We extend Noether's theorem to dynamical optimal control systems being under the action of nonconservative forces. A systematic way of calculating conservation laws for nonconservative optimal control problems is given. As a corollary, the…

Optimization and Control · Mathematics 2007-05-23 Gastao S. F. Frederico , Delfim F. M. Torres

We explore the theory of illfounded and cyclic proofs for the propositional modal $\mu$-calculus. A fine analysis of provability for classical and intuitionistic modal logic provides a novel bridge between finitary, cyclic and illfounded…

Logic · Mathematics 2025-09-03 Bahareh Afshari , Graham E. Leigh , Guillermo Menèndez Turata

We prove an algebraic preservation theorem for positive Horn definability in aleph-zero categorical structures. In particular, we define and study a construction which we call the periodic power of a structure, and define a periomorphism of…

Logic in Computer Science · Computer Science 2015-07-01 Hubie Chen , Moritz Müller

This paper presents a type theory with a form of equality reflection: provable equalities can be used to coerce the type of a term. Coercions and other annotations, including implicit arguments, are dropped during reduction of terms. We…

Programming Languages · Computer Science 2011-01-25 Vilhelm Sjöberg , Aaron Stump
‹ Prev 1 3 4 5 6 7 10 Next ›