Related papers: Omitting types in logic of metric structures
The main aim of the article is to show, in the absence of the Axiom of Choice, relationships between the following, independent of $\mathbf{ZF}$, statements: "Every countable product of compact metrizable spaces is separable (respectively,…
In previous papers on this project a general static logical framework for formalizing and mechanizing set theories of different strength was suggested, and the power of some predicatively acceptable theories in that framework was explored.…
Isaak Moiseevich Yaglom deduced complete classification of geometric spaces. In this work, supposed to your attention, author formalizes Yaglom's approach and constructs uniform theory of geometric spaces on analytic level. Among its…
Constructive type theory combines logic and programming in one language. This is useful both for reasoning about programs written in type theory, as well as for reasoning about other programming languages inside type theory. It is…
In this paper, we investigate connections between structures present in every generic extension of the universe $V$ and computability theory. We introduce the notion of {\em generic Muchnik reducibility} that can be used to to compare the…
We prove that in a countable theory $T$ fully stable over a predicate $P$, any $\lam$-complete set $A$ has the $\lam$-existence property. This means that $A$ can be extended to a $\lam$-saturated model of $T$ without changing the $P$-part.…
For a countable abelian group $G$ we investigate generic properties of the space of all invariant metrics on $G$. We prove that for every such an unbounded group $G$, i.e. group which has elements of arbitrarily high order, there is a dense…
System I is a proof language for a fragment of propositional logic where isomorphic propositions, such as $A\wedge B$ and $B\wedge A$, or $A\Rightarrow(B\wedge C)$ and $(A\Rightarrow B)\wedge(A\Rightarrow C)$ are made equal. System I enjoys…
A class of languages C is perfect if it is closed under Boolean operations and the emptiness problem is decidable. Perfect language classes are the basis for the automata-theoretic approach to model checking: a system is correct if the…
We introduce and study a multiplicative analogue of additive indecomposability for linear order types that we call untranscendability, as well as a strengthening that we call $s$-untranscendability. We show that, with the unique exception…
A knowledge system S describing a part of real world does in general not contain complete information. Reasoning with incomplete information is prone to errors since any belief derived from S may be false in the present state of the world.…
We find the model completion of the theory modules over $A$, where $A$ is a finitely generated commutative algebra over a field $K$. This is done in a context where the field $K$ and the module are represented by sorts in the theory, so…
The program Reverse Mathematics (RM for short) seeks to identify the axioms necessary to prove theorems of ordinary mathematics, usually working in the language of second-order arithmetic $L_{2}$. A major theme in RM is therefore the study…
A recent article of Chernikov, Hrushovski, Kruckman, Krupinski, Moconja, Pillay and Ramsey finds the first examples of simple structures with formulas which do not fork over $\emptyset$ but are universally measure zero. In this article we…
Structural proof theory is praised for being a symbolic approach to reasoning and proofs, in which one can define schemas for reasoning steps and manipulate proofs as a mathematical structure. For this to be possible, proof systems must be…
We develop a theory of large scale geometry of metrisable topological groups that, in a significant number of cases, allows one to define and identify a unique quasi-isometry type intrinsic to the topological group. Moreover, this…
We introduce the notion of limiting theories, giving examples and providing a sufficient condition under which the first order theory of a structure is the limit of the first order theories of a collection of substructures. We also give a…
Machine learning researchers and practitioners steadily enlarge the multitude of successful learning models. They achieve this through in-depth theoretical analyses and experiential heuristics. However, there is no known general-purpose…
By nature, transmissible human knowledge is enumerable: every sentence, movie, audio record can be encoded in a sufficiently long string of 0's and 1's. The works of G\"odel, Turing and others showed that there are inherent limits and…
The usual reading of logical implication "A implies B" as "if A then B" fails in intuitionistic logic: there are formulas A and B such that "A implies B" is not provable, even though B is provable whenever A is provable. Intuitionistic…