English
Related papers

Related papers: On Weak and Strong Interpolation in Algebraic Logi…

200 papers

In Pure Inductive Logic, the principle of Strong Predicate Exchangeability is a rational principle based on symmetry that sits in between the principles of Predicate Exchangeability and Atom Exchangeability. We will show a de Finetti -…

Logic · Mathematics 2015-07-02 Malte S. Kließ

The first-order theory of MALL (multiplicative, additive linear logic) over only equalities is an interesting but weak logic since it cannot capture unbounded (infinite) behavior. Instead of accounting for unbounded behavior via the…

Logic in Computer Science · Computer Science 2010-12-02 David Baelde

In \cite{Craig}, we introduced a syntactically defined and highly general class of calculi known as \emph{semi-analytic}. We then demonstrated that any sufficiently strong (modal) substructural logic with a semi-analytic calculus must…

Logic in Computer Science · Computer Science 2025-06-27 Amirhossein Akbar Tabatabai , Raheleh Jalali

In this note, we shall give an improved lower bound for the argument of a power of a given algebraic number which has absolute value one but is not a root of unity.

Number Theory · Mathematics 2025-06-03 Tomohiro Yamada

We show that quasi-projective relation algebras and directed cylindric algebras are equivalent categorialy. We work out a Godels second incompleteness theorem for finite varibale fragments of first order logic. We show that distinct set…

Logic · Mathematics 2013-04-04 Tarek Sayed Ahmed

We study the expressive power of the two-variable fragment of order-invariant first-order logic. This logic departs from first-order logic in two ways: first, formulas are only allowed to quantify over two variables. Second, formulas can…

Logic in Computer Science · Computer Science 2022-07-12 Julien Grange

We prove that any equational basis that defines RRA over wRRA must contain infinitely many variables. The proof uses a construction of arbitrarily large finite weakly representable but not representable relation algebras whose "small"…

Logic · Mathematics 2019-02-20 Jeremy F. Alm , Robin Hirsch , Roger D. Maddux

We show that under certain conditions, well-studied algebraic properties transfer from the class $\mathcal{Q}_{_\text{RFSI}}$ of the relatively finitely subdirectly irreducible members of a quasivariety $\mathcal{Q}$ to the whole…

Logic · Mathematics 2023-06-06 Wesley Fussner , George Metcalfe

We show that a direct limit of surjections of (weak) Golod--Shafarevich algebras is a weak Golod--Shafarevich algebra as well. This holds both for graded and for filtered algebras provided that the filtrations are induced by the filtration…

Rings and Algebras · Mathematics 2014-12-31 Dmitri Piontkovski

We study the expressive power of successor-invariant first-order logic, which is an extension of first-order logic where the usage of an additional successor relation on the structure is allowed, as long as the validity of formulas is…

Logic in Computer Science · Computer Science 2023-06-22 Julien Grange

We show that irreducibility is not a first-order definable property of real algebraic varieties. The proof is based on the recent o-minimality result for the exponential function. We conjecture that irreducibility is not a definable…

Logic · Mathematics 2009-10-31 Pascal Koiran

We answer an implicit question of Ian Hodkinson's. We show that atomic Pinters algebras may not be completely representable, however the class of completely representable Pinters algebras is elementary and finitely axiomatizable. We obtain…

K-Theory and Homology · Mathematics 2013-04-03 Tarek Sayed Ahmed

We start a systematic investigation of the size of Craig interpolants, uniform interpolants, and strongest implicates for (quasi-)normal modal logics. Our main upper bound states that for tabular modal logics, the computation of strongest…

Logic in Computer Science · Computer Science 2026-05-15 Balder ten Cate , Louwe Kuijer , Frank Wolter

Proof-theoretic methods are developed for subsystems of Johansson's logic obtained by extending the positive fragment of intuitionistic logic with weak negations. These methods are exploited to establish properties of the logical systems.…

Logic · Mathematics 2019-07-12 Marta Bílková , Almudena Colacito

We give a new proof of the fact that finite bipartite graphs cannot be axiomatized by finitely many first-order sentences among FINITE graphs. (This fact is a consequence of a general theorem proved by L. Ham and M. Jackson, and the…

Logic · Mathematics 2021-04-01 Gábor Czédli

We show that the weak monadic second order theory of the structure $({\mathbb Q}, <)$ is first order interpretable in its automorphism group.

Logic · Mathematics 2021-08-24 J K Truss

We formalise and mechanise a construtive, proof theoretic proof of Craig's Interpolation Theorem in Isabelle/HOL. We give all the definitions and lemma statements both formally and informally. We also transcribe informally the formal…

Logic in Computer Science · Computer Science 2007-05-23 Tom Ridge

We present and analyze a natural hierarchy of weak theories, develop analysis in them, and show that they are interpretable in bounded quantifier arithmetic $\text{I}\Delta_0$ (and hence in Robinson arithmetic Q). The strongest theories…

Logic · Mathematics 2016-12-20 Dmytro Taranovsky

We investigate the weak Hopf algebras of Li based on $U_q[sl_n]$ and Sweedler's finite dimensional example. We give weak Hopf algebra isomorphisms between the weak generalisations of $U_q[sl_n]$ which are ``upgraded'' automorphisms of…

Quantum Algebra · Mathematics 2007-05-23 N. Aizawa , P. S. Isaac

The relation between representations and positive definite functions is a key concept in harmonic analysis on topological groups. Recently this relation has been studied on topological groupoids. This is the first in a series of papers in…

Operator Algebras · Mathematics 2007-05-23 Massoud Amini , Alireza Medghalchi