Related papers: Computable structures in generic extensions

Orbit-finite models of computation generalise the standard models of computation, to allow computation over infinite objects that are finite up to symmetries on atoms, denoted by $\mathbb{A}$. Set theory with atoms is used to reason about…

A classical theorem of Hechler asserts that the structure $\left(\omega^\omega,\le^*\right)$ is universal in the sense that for any $\sigma$-directed poset P with no maximal element, there is a ccc forcing extension in which…

We obtain several results concerning the concept of isotypic structures. Namely we prove that any field of finite transcendence degree over a prime subfield is defined by types; then we construct isotypic but not isomorphic structures with…

Let $A$ be a unital $C^*$-algebra generated by some separable operator system $S$. More than a decade ago, Arveson conjectured that $S$ is hyperrigid in $A$ if all irreducible representations of $A$ are boundary representations for $S$.…

Every crowded space $X$ is ${\omega}$-resolvable in the c.c.c generic extension $V^{Fn(|X|,2})$ of the ground model. We investigate what we can say about ${\lambda}$-resolvability in c.c.c-generic extensions for ${\lambda}>{\omega}$? A…

We investigate weak and strong structures for generalized topological spaces, among others products, sums, subspaces, quotients, and the complete lattice of generalized topologies on a given set. Also we introduce $T_{3.5}$ generalized…

This survey paper examines the effective model theory obtained with the BSS model of real number computation. It treats the following topics: computable ordinals, satisfaction of computable infinitary formulas, forcing as a construction…

We develop a novel formal theory of finite structures, based on a view of finite structures as a fundamental artifact of computing and programming, forming a common platform for computing both within particular finite structures, and in the…

In this paper we develop general techniques for classes of computable real numbers generated by subsets of total computable (recursive functions) with special restrictions on basic operations in order to investigate the following problems:…

Let G be a countable group. We proof that there is a model companion for the approximate theory of a Hilbert space with a group G of automorphisms. We show that G is amenable if and only if the structure induced by countable copies of the…

It is known that a countable $\omega$-categorical structure interprets all finite structures primitively positively if and only if its polymorphism clone maps to the clone of projections on a two-element set via a continuous clone…

In this paper, some features of countably $\alpha$-compact topological spaces are presented and proven. The connection between countably $\alpha$% -compact, Tychonoff, and $\alpha$-Hausdorff spaces is explained. The space is countably…

We initiate the study of computable presentations of real and complex C*-algebras under the program of effective metric structure theory. With the group situation as a model, we develop corresponding notions of recursive presentations and…

We review some definitions and basic notions relating to generalised spin structures and introduce the notion of reducibility. We discuss connections on these structures, define a covariant Lie derivative for associated bundles and develop…

We develop a compositional framework for generalized reversible computing using copy-discard categories and resource theories. We introduce partitioned matrices between partitioned sets as subdistribution matrices which preserve the…

We introduce a reducibility on classes of structures, essentially a uniform enumeration reducibility. This reducibility is inspired by the Friedman-Stanley paper on using Borel reductions to compare classes of countable structures. This…

By Solovay's celebrated completeness result on formal provability we know that the provability logic $\mathrm GL$ describes exactly all provable structural properties for any sound and strong enough arithmetical theory with a decidable…

We compare two different notions of generic expansions of countable saturated structures. One kind of genericity is related to model-companions and to amalgamation constructions \'a la Hrushovski-Fra\"iss\'e. Another notion of generic…

For a relational structure ${\mathbb X}$ we investigate the partial order $\langle {\mathbb P} ({\mathbb X}) ,\subset \rangle$, where ${\mathbb P} ({\mathbb X}):=\{ f[X]: f\in \mathop{\rm Emb}\nolimits ({\mathbb X})\}$. Here we consider…

We indicate a way of distinguishing between structures, for which, two structures are said to be separable.Being separable implies being non-isomorphic. We show that for any first order theory $T$ in a countable language, if it has an…