Related papers: Omitting types in logic of metric structures
We prove a Model Existence Theorem for a fully infinitary logic for metric structures. This result is based on a generalization of the notions of approximate formulas and approximate truth in normed structures introduced by Henson and…
This paper proposes an alternative to standard first-order logic that seeks greater naturalness, generality, and semantic self-containment. The system removes the first-order restriction, avoids type hierarchies, and dispenses with external…
This paper introduces an ML / Haskell like programming language with nested inductive and coinductive algebraic datatypes called \chariot. Functions are defined by arbitrary recursive definitions and can thus lead to non-termination and…
The usual definition of the set of constructible reals is $\Sigma ^1_2$. This set can have a simpler definition if, for example, it is countable or if every real is constructible. H. Friedman asked if the set of constructible reals can be…
As defined by Dunn, Moss, and Wang, an universal test set in an ortholattice $L$ is a subset $T$ such that each term takes value $1$, only, if it does so under all substitutions from $T$. Generalizing their result for ortholattices of…
This expository paper treats the model theory of probability spaces using the framework of continuous $[0,1]$-valued first order logic. The metric structures discussed, which we call probability algebras, are obtained from probability…
According to the math tea argument, there must be real numbers that we cannot describe or define, because there are uncountably many real numbers, but only countably many definitions. And yet, the existence of pointwise-definable models of…
The multiplicative theory of a set of numbers (which could be natural, integer, rational, real or complex numbers) is the first-order theory of the structure of that set with (solely) the multiplication operation (that set is taken to be…
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…
The paper introduces the class of O-metric spaces, a novel generalization of metric-type spaces, classifying almost all possible metric types into upward and downward O-metrics. We list some topologies arising from O-metrics and discuss…
In this essay, I present the advantages and, I dare say, the beauty of programming in a language with set-theoretic types, that is, types that include union, intersection, and negation type connectives. I show by several examples how…
We bring forward a logical system of transition algebras that enhances many-sorted first-order logic using features from dynamic logics. The sentences we consider include compositions, unions, and transitive closures of transition…
All constructive methods employed in modern mathematics produce only countable sets, even when designed to transcend countability. We show that any constructive argument for uncountability -- excluding diagonalization techniques --…
In this paper the metric on the set of mixing actions of a countable infinite group is introduced so that the corresponding space is complete and separable. Keywords and phrases. Monotilable group, measure preserving transformations, mixing…
A multiset consists of elements, but the notion of a multiset is distinguished from that of a set by carrying information of how many times each element occurs in a given multiset. In this work we will investigate the notion of iterative…
The paper studies a cluster of systems for fully disquotational truth based on the restriction of initial sequents. Unlike well-known alternative approaches, such systems display both a simple and intuitive model theory and remarkable…
A theory $T$ is said to be relatively decidable if for every model of $T$, one can compute the elementary diagram of that model from its atomic diagram together with $T$. We verify a conjecture of Chubb, Miller, and Solomon by showing that…
In this Phd. thesis, a structural analysis of construction schemes is developed. The importance of this study will be justified by constructing several distinct combinatorial objects which have been of great interest in mathematics. We then…
In the present article we describe how one can define Hausdorff measure allowing empty elements in coverings, and using infinite countable coverings only. In addition, we discuss how the use of different nonequivalent interpretations of the…
The class of generic structures among those consisting of the measure algebra of a probability space equipped with an automorphism is axiomatizable by positive sentences interpreted using an approximate semantics. The separable generic…