Related papers: The Reduction Property Revisited
The decision problem of membership in the Representation Class of Relation Algebras (RRA) for finite structures is undecidable. However, this does not hold for many Relation Algebra reduct languages. Two well known properties that are…
We prove that the NTP$_1$ property of a geometric theory $T$ is inherited by theories of lovely pairs and $H$-structures associated to $T$. We also provide a class of examples of nonsimple geometric NTP$_1$ theories.
Induction is the process by which we obtain predictive laws or theories or models of the world. We consider the structural aspect of induction. We answer the question as to whether we can find a finite and minmalistic set of operations on…
It is well known that many theorems in recursion theory can be "relativized". This means that they remain true if partial recursive functions are replaced by functions that are partial recursive relative to some fixed oracle set. Uspensky…
We present a unified theory to treat conservation laws in light-matter interactions. It can be used to describe and engineer the transfer of any measurable property from the electromagnetic field to any object. The theory allows to…
A problem is a multivalued function from a set of \emph{instances} to a set of \emph{solutions}. We consider only instances and solutions coded by sets of integers. A problem admits preservation of some computability-theoretic weakness…
We define a notion of Property (T) for an arbitrary $C^*$-algebra $A$ admitting a tracial state. We extend this to a notion of Property (T) for the pair $(A,B),$ where $B$ is a $C^*$-subalgebra of $A.$ Let $\Gamma$ be a discrete group and…
Our objective is to extend the standard results of preservation and reflection of properties by bisimulations to the coalgebraic setting, as well as to study under what conditions these results hold for simulations. The notion of…
Three philosophical principles are often quoted in connection with Leibniz: "objects sharing the same properties are the same object" (Identity of indiscernibles), "everything can possibly exist, unless it yields contradiction" (Possibility…
A conjecture of Erd\H{o}s states that, for any large prime $q$, every reduced residue class $\pmod q$ can be represented as a product $p_1p_2$ of two primes $p_1,p_2\leq q$. We establish a ternary version of this conjecture, showing that,…
We introduce an interesting method of proving separable reduction theorems - the method of elementary submodels. We are studying whether it is true that a set (function) has given property if and only if it has this property with respect to…
We consider the situation in which some class of structures has the Strong Amalgamation Property (SAP) with the further requirement that the amalgamating structure can be taken over the set theoretical union of (the images of) the domains…
We study the relation (and differences) between stability and Property (S) in the simple and stably finite framework. This leads us to characterize stable elements in terms of its support, and study these concepts from different sides :…
The results presented in this paper are refinements of some results presented in a previous paper. Three such refined results are presented. The first one relaxes one of the basic hypotheses assumed in the previous paper, and thus extends…
Strictly positive logics recently attracted attention both in the description logic and in the provability logic communities for their combination of efficiency and sufficient expressivity. The language of Reflection Calculus RC consists of…
Hirschfeldt and Jockusch (2016) introduced a two-player game in which winning strategies for one or the other player precisely correspond to implications and non-implications between $\Pi^1_2$ principles over $\omega$-models of…
We develop the technique of reduced word manipulation to give a range of results concerning reduced words and permutations more generally. We prove a broad connection between pattern containment and reduced words, which specializes to our…
We show that arithmetical transfinite recursion is equivalent to a suitable formalization of the following: For every ordinal $\alpha$ there exists an ordinal $\beta$ such that $1+\beta\cdot(\beta+\alpha)$ (ordinal arithmetic) admits an…
In this work, we aim at understanding incompleteness in an abstract way via metamathematical properties of formal theories. We systematically examine the relationships between the following twelve important metamathematical properties of…
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…