English
Related papers

Related papers: Doubly partially conservative sentences

200 papers

In this paper, the deductive system for double propositional logic DL and gamma DL existential graphs are presented. It rigorously proves the consistency of the DL and that the DL theorems correspond exactly to the valid existential graphs…

Logic · Mathematics 2023-12-13 Manuel Sierra Aristizabal

We consider the infinite one-sided sequence generated by the period-doubling substitution $\sigma(a,b)=(ab,aa)$, denoted by $\mathbb{D}$. Since $\mathbb{D}$ is uniformly recurrent, each factor $\omega$ appears infinite many times in the…

Dynamical Systems · Mathematics 2016-06-17 Huang Yuke , Wen Zhiying

This work presents the deductive system Double Propositional Logic, LD, along with the semantics of possible worlds that characterize it. LD includes an alternate affirmation operator and an alternate negation operator and is not valid for…

Logic · Mathematics 2023-10-13 Manuel Sierra Aristizábal

The Guarded Negation Fragment (GNFO) is a fragment of first-order logic that contains all positive existential formulas, can express the first-order translations of basic modal logic and of many description logics, along with many sentences…

Logic in Computer Science · Computer Science 2020-05-15 Vince Barany , Michael Benedikt , Balder ten Cate

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

The article presents a new interpretation for Zipf-Mandelbrot's law in natural language which rests on two areas of information theory. Firstly, we construct a new class of grammar-based codes and, secondly, we investigate properties of…

Information Theory · Computer Science 2020-03-11 Łukasz Dębowski

We present new models of non-linear electromagnetism which satisfy the Noether-Gaillard-Zumino current conservation and are, therefore, self-dual. The new models differ from the Born-Infeld-type models in that they deform the Maxwell theory…

High Energy Physics - Theory · Physics 2015-06-03 Wissam Chemissany , Renata Kallosh , Tomas Ortin

We prove that, consistently, there exists a weakly but not strongly inaccessible cardinal $\lambda$ for which the sequence $\langle 2^\theta:\theta<\lambda\rangle$ is not eventually constant and the weak diamond fails at $\lambda$. We also…

Logic · Mathematics 2021-03-12 Shimon Garti , Saharon Shelah

We investigate a model-theoretic property that generalizes the classical notion of "preservation under substructures". We call this property \emph{preservation under substructures modulo bounded cores}, and present a syntactic…

Logic in Computer Science · Computer Science 2012-07-13 Abhisekh Sankaran , Bharat Adsul , Vivek Madan , Pritish Kamath , Supratik Chakraborty

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 consider the infinite one-sided sequence over alphabet $\{a,b\}$ generated by the period-doubling substitution $\sigma(a)=ab$ and $\sigma(b)=aa$, denoted by $\mathbb{D}$. Let $r_p(\omega)$ be the $p$-th return word of factor $\omega$.…

Dynamical Systems · Mathematics 2017-03-22 Yu-Ke Huang , Zhi-Ying Wen

We investigate the duality between algebraic and coalgebraic recognition of languages to derive a generalization of the local version of Eilenberg's theorem. This theorem states that the lattice of all boolean algebras of regular languages…

Formal Languages and Automata Theory · Computer Science 2015-01-19 Jiri Adamek , Stefan Milius , Robert Myers , Henning Urbat

We introduce a novel logical notion--partial entailment--to propositional logic. In contrast with classical entailment, that a formula P partially entails another formula Q with respect to a background formula set \Gamma intuitively means…

Logic in Computer Science · Computer Science 2014-01-17 Yi Zhou , Yan Zhang

We develop a duality for (modal) lattices that need not be distributive, and use it to study positive (modal) logic beyond distributivity, which we call weak positive (modal) logic. This duality builds on the Hofmann, Mislove and Stralka…

Logic · Mathematics 2023-12-01 Nick Bezhanishvili , Anna Dmitrieva , Jim de Groot , Tommaso Moraschini

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

In this thesis we elaborate on the three subjects of the title. We first show that supertubes exist and still preserve some supersymmetry in a large variety of curved backgrounds. Within the AdS/CFT correspondence we study the supersymmetry…

High Energy Physics - Theory · Physics 2007-05-23 Toni Mateos

We develop a new theory of strong subalgebras and linear congruences that are defined globally. Using this theory we provide a new proof of the correctness of Zhuk's algorithm for all tractable CSPs on a finite domain, and therefore a new…

Computational Complexity · Computer Science 2024-10-22 Dmitriy Zhuk

We extend the known consistency conditions on the low-energy theory of six-dimensional N = 1 supergravity. We review some facts about the theory of two-form gauge fields and conclude that the charge lattice Gamma for such a theory has to be…

High Energy Physics - Theory · Physics 2015-05-27 Nathan Seiberg , Washington Taylor

The provability logic of a theory T is the set of modal formulas, which under any arithmetical realization are provable in T . We slightly modify this notion by requiring the arithmetical realizations to come from a specified set $\Gamma$.…

Logic · Mathematics 2020-06-19 Thomas F. Icard , Joost J. Joosten

The relative Gromov seminorm is a finer invariant than stable commutator length where a relative homology class is fixed. We show a duality result between bounded cohomology and the relative Gromov seminorm, analogously to Bavard duality…

Geometric Topology · Mathematics 2024-08-16 Alexis Marchand