Related papers: Epimorphisms, definability and cardinalities
We give a syntactic characterization of abstract elementary classes (AECs) closed under intersections using a new logic with a quantifier for isomorphism types that we call structural logic: we prove that AECs with intersections correspond…
It is proved that epimorphisms are surjective in a range of varieties of residuated structures, including all varieties of Heyting or Brouwerian algebras of finite depth, and all varieties consisting of Goedel algebras, relative Stone…
We consider the problem of characterizing isomorphisms of types, or, equivalently, constructive cardinality of sets, in the simultaneous presence of disjoint unions, Cartesian products, and exponentials. Mostly relying on results about…
We introduce some notions of invariant elementary definability which extend the notions of first-order order-invariant definability, and, more generally, definability invariant with respect to arbitrary numerical relations. In particular,…
A commutative residuated lattice A is said to be subidempotent if the lower bounds of its neutral element e are idempotent (in which case they naturally constitute a Brouwerian algebra A*). It is proved here that epimorphisms are surjective…
We prove that epimorphisms are surjective in certain categories of ordered F-algebras. It then turns out that epimorphisms are also surjective in the category of all (unordered) algebras of type F.
We consider epimorphisms and several variant notions -- split, effective, regular, strong, and extremal -- and determine which of these coincide in the metric coarse and coarsely Lipschitz categories. In particular, we characterise extremal…
We show that several dichotomy theorems concerning the second level of the Borel hierarchy are special cases of the $\aleph_0$-dimensional generalization of the open graph dichotomy, which itself follows from the usual proof(s) of the…
It is well-known that biological phenomena are emergent. Emergent phenomena are quite interesting and amazing. However, they are difficult to be understood. Due to this difficulty, we propose a theory to describe emergence based on a…
We give a systematic construction of epimorphisms between 2-bridge link groups. Moreover, we show that 2-bridge links having such an epimorphism between their link groups are related by a map between the ambient spaces which only have a…
We introduce a topology on the space of all isomorphism types represented in a given class of countable models, and use this topology as an aid in classifying the isomorphism types. This mixes ideas from effective descriptive set theory and…
For any first order theory T we construct a Boolean valued model M, in which precisely the T--provable formulas hold, and in which every (Boolean valued) subset which is invariant under all automorphisms of M is definable by a first order…
Two first-order logic theories are definitionally equivalent if and only if there is a bijection between their model classes that preserves isomorphisms and ultraproducts (Theorem 2). This is a variant of a prior theorem of van Benthem and…
A condition, in two variants, is given such that if a property P satisfies this condition, then every logic which is at least as strong as first-order logic and can express P fails to have the compactness property. The result is used to…
There are two main results. The first states that isotropy subgroups of groups acting transitively on a rationally hyperbolic spaces have infinitely generated rational cohomology algebra. Using this fact, we prove that the analogous…
The usage of elementary submodels is a simple but powerful method to prove theorems, or to simplify proofs in infinite combinatorics. First we introduce all the necessary concepts of logic, then we prove classical theorems using elementary…
We try to build, provably in ZFC, for a first order T a model in which any isomorphism between two Boolean algebras is definable. The problem, compared to [Sh:384], is with pseudo-finite Boolean algebras. A side benefit is that we do not…
Probability theory as extended logic is completed such that essentially any probability may be determined. This is done by considering propositional logic (as opposed to predicate logic) as syntactically suffcient and imposing a symmetry…
We show that if we enrich first order logic by allowing quantification over isomorphisms between definable ordered fields the resulting logic, L(Q_{Of}), is fully compact. In this logic, we can give standard compactness proofs of various…
This paper introduces epistemic graphs as a generalization of the epistemic approach to probabilistic argumentation. In these graphs, an argument can be believed or disbelieved up to a given degree, thus providing a more fine--grained…