English
Related papers

Related papers: A variety of partially conservative sentences

200 papers

The purpose of the present paper is to analyze several variants of Solovay's theorem on the existence of doubly partially conservative sentences. First, we investigate $\Theta$ sentences that are doubly $(\Gamma, \Lambda)$-conservative over…

Logic · Mathematics 2025-03-18 Haruka Kogure , Taishi Kurahashi

We investigate sentences which are simultaneously partially conservative over several theories. First, we generalize Bennet's results on this topic to the case of more than two theories. In particular, for any finite family $\{T_i\}_{i \leq…

Logic · Mathematics 2022-03-15 Taishi Kurahashi , Yuya Okawa , V. Yu. Shavrukov , Albert Visser

For a class $\Gamma$ of formulas, $\Gamma$ local reflection principle $\mathrm{Rfn}_{\Gamma}(T)$ for a theory $T$ of arithmetic is a scheme formalizing the $\Gamma$-soundness of $T$. Beklemishev proved that for every $\Gamma \in \{\Sigma_n,…

Logic · Mathematics 2023-11-30 Haruka Kogure , Taishi Kurahashi

In this paper, we prove that theta correspondence preserves unitarity under certain restrictions.

Representation Theory · Mathematics 2007-05-23 Hongyu He

This paper investigates the expressiveness of a fragment of first-order sentences in Gaifman normal form, namely the positive Boolean combinations of basic local sentences. We show that they match exactly the first-order sentences preserved…

Logic in Computer Science · Computer Science 2022-04-06 Aliaume Lopez

We systematically study conservation theorems on theories of semi-classical arithmetic, which lie in-between classical arithmetic $\mathsf{PA}$ and intuitionistic arithmetic $\mathsf{HA}$. Using a generalized negative translation, we first…

Logic · Mathematics 2022-03-15 Makoto Fujiwara , Taishi Kurahashi

Given a fixed constraint language $\Gamma$, the conservative CSP over $\Gamma$ (denoted by c-CSP($\Gamma$)) is a variant of CSP($\Gamma$) where the domain of each variable can be restricted arbitrarily. A dichotomy is known for conservative…

Computational Complexity · Computer Science 2016-06-21 Clément Carbonnel

Preservation theorems provide a direct correspondence between the syntactic structure of first-order sentences and the closure properties of their respective classes of models. A line of work has explored preservation theorems relativised…

Logic in Computer Science · Computer Science 2024-08-06 Ioannis Eleftheriadis

Induction is typically formalized as a rule or axiom extension of the LK-calculus. While this extension of the sequent calculus is simple and elegant, proof transformation and analysis can be quite difficult. Theories with an induction…

Logic · Mathematics 2018-04-03 David M. Cerna , Anela Lolic

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

If the sequent (Gamma entails forall x exists y A) is provable in first order constructive natural deduction, then the theory (Gamma, forall x (f (x)/y)A), where f is a new function symbol, is a conservative extension of Gamma.

Logic in Computer Science · Computer Science 2023-05-18 Gilles Dowek , Benjamin Werner

We investigate the set of Pi-1-2 sentences which are Pi-1-1 conservative over the theories of reverse mathematics RCA0+ISigma_n and ACA0. We exhibit new elements of these sets and conclude that the sets are Pi_2 complete. Along the way, we…

Logic · Mathematics 2013-08-26 Henry Towsner

It is known that irreducible cuspidal characters satisfy the preservation principle in the Howe correspondences of finite reductive dual pairs. In this article, we generalize the preservation principle to any irreducible characters of…

Representation Theory · Mathematics 2022-07-15 Shu-Yen Pan

Various concepts of grammatical compositionality arise in many theories of both natural and artificial languages, and often play a key role in accounts of the syntax-semantics interface. We propose that many instances of compositionality…

Computation and Language · Computer Science 2022-01-17 Norman E. Trushaev

We answer Klop and de Vrijer's question whether adding surjective-pairing axioms to the extensional lambda calculus yields a conservative extension. The answer is positive. As a byproduct we obtain a "syntactic" proof that the extensional…

Logic · Mathematics 2017-01-11 Kristian Stoevring

Cie\'sli\'nski asked whether compositional truth theory with the additional axiom that all propositional tautologies are true is conservative over Peano Arithmetic. We provide a partial answer to this question, showing that if we…

Logic · Mathematics 2020-11-16 Bartosz Wcisło

This paper explores the consistency strength of The Proper Forcing Axiom ($\textsf{PFA}$) and the theory (T) which involves a variation of the Viale-Wei$\ss$ guessing hull principle. We show that (T) is consistent relative to a supercompact…

Logic · Mathematics 2016-08-23 Nam Trang

Let $\mathsf{TT}^1$ be the combinatorial principle stating that every finite coloring of the infinite full binary tree has a homogeneous isomorphic subtree. Let $\mathsf{RT}^2_2$ and $\mathsf{WKL}_0$ denote respectively the principles of…

Logic · Mathematics 2021-10-13 Chitat Chong , Wei Wang , Yue Yang

In this paper we study an action of the absolute Galois group $\Gamma$ on bicolored plane trees induced by the action of $\Gamma$ on equivalence classes of conservative polynomials which are the simplest example of postcritically finite…

Number Theory · Mathematics 2007-05-23 Fedor Pakovich

In this paper we provide a (negative) solution to a problem posed by Stanis{\l}aw Krajewski. Consider a recursively enumerable theory U and a finite expansion of the signature of U that contains at least one predicate symbol of arity $\ge$…

Logic · Mathematics 2017-12-06 Fedor Pakhomov , Albert Visser
‹ Prev 1 2 3 10 Next ›