Searcharxiv⌕ Search

arXiv subjects

Tapani Hyttinen

Publications and source records attributed to Tapani Hyttinen.

At least 37 records · Page 2Linked to original sources
arXiv2017

On large cardinals and generalized Baire spaces

Working under large cardinal assumptions, we study the Borel-reducibility between equivalence relations modulo restrictions of the non-stationary ideal on some fixed cardinal $κ$. We show the consistency of $E^{λ^{++},λ^{++}}_{λ\text{-club}}$, the relation of equivalence modulo the non-stationary ideal restricted to $S^{λ^{++}}_λ$ in the space $(λ^{++})^{λ^{++}}$, being continuously reducible to $E^{2,λ^{++}}_{λ^+\text{-club}}$, the relation of equivalence modulo the non-stationary ideal restricted to $S^{λ^{++}}_{λ^+}$ in the space $2^{λ^{++}}$. Then we show the consistency of $E^{2,κ}_{reg}$, the relation of equivalence modulo the non-stationary ideal restricted to regular cardinals in the space $2^κ$, being $Σ_1^1$-complete. We finish by showing, for $Π_2^1$-indescribable $κ$, that the isomorphism relation between dense linear orders of cardinality $κ$ is $Σ_1^1$-complete.

math.LO↗
arXiv2017

Hilbert Spaces with Generic Predicates

We study the model theory of expansions of Hilbert spaces by generic predicates. We first prove the existence of model companions for generic expansions of Hilbert spaces in the form first of a distance function to a random substructure, then a distance to a random subset. The theory obtained with the random substructure is ω-stable, while the one obtained with the distance to a random subset is $TP_2$ and $NSOP_1$. That example is the first continuous structure in that class.

math.LO↗
arXiv2017

Quasiminimal structures, groups and Zariski-like geometries

We generalize Hrushovski's Group Configuration Theorem to quasiminimal classes. As an application, we present Zariski-like structures, a generalization of Zariski geometries, and show that a group can be found there if the pregeometry obtained from the bounded closure operator is non-trivial.

math.LO↗
arXiv2016

A Logic for Arguing About Probabilities in Measure Teams

We use sets of assignments, a.k.a. teams, and measures on them to define probabilities of first-order formulas in given data. We then axiomatise first-order properties of such probabilities and prove a completeness theorem for our axiomatisation. We use the Hardy-Weinberg Principle of biology and the Bell's Inequalities of quantum physics as examples.

math.LO↗
arXiv2016

Quantum Team Logic and Bell's Inequalities

A logical approach to Bell's Inequalities of quantum mechanics has been introduced by Abramsky and Hardy [2]. We point out that the logical Bell's Inequalities of [2] are provable in the probability logic of Fagin, Halpern and Megiddo [4]. Since it is now considered empirically established that quantum mechanics violates Bell's Inequalities, we introduce a modified probability logic, that we call quantum team logic, in which Bell's Inequalities are not provable, and prove a Completeness Theorem for this logic. For this end we generalise the team semantics of dependence logic [7] first to probabilistic team semantics, and then to what we call quantum team semantics.

math.LO↗
arXiv2016

A Borel-reducibility Counterpart of Shelah's Main Gap Theorem

We study the Borel-reducibility of isomorphism relations of complete first order theories and show the consistency of the following: For all such theories T and T', if T is classifiable and T' is not, then the isomorphism of models of T' is strictly above the isomorphism of models of T with respect to Borel-reducibility. In fact, we can also ensure that a range of equivalence relations modulo various non-stationary ideals are strictly between those isomorphism relations. The isomorphism relations are considered on models of some fixed uncountable cardinality obeying certain restrictions.

math.LO↗
arXiv2016

Measuring dependence in metric abstract elementary classes with perturbations

We define and study a metric independence notion in a homogeneous metric abstract elementary class with perturbations that is $d^p$-superstable (superstable wrt. the perturbation topology), weakly simple and has complete type spaces and we give a new example of such a class based on B. Zilber's approximations of Weyl algebras. We introduce a way to measure the dependence of a tuple $a$ from a set $B$ over another set $A$. We prove basic properties of the notion, e.g. that $a$ is independent of $B$ over $A$ in the usual sense of homogeneous model theory if and only if the measure of dependence is $<\varepsilon$ for all $\varepsilon >0$. As an example of our measure of dependence we show a connection between the measure and entropy in models from quantum mechanics in which the spectrum of the observable is discrete. As an application, we show that weak simplicity implies a very strong form of simplicity and study the question of when the dependence inside a set of all realisations of some type can be seen to arise from a pregeometry in cases when the type is not regular. In the end of the paper, we demonstrate our notions and results in one more example: a class built from the $p$-adic integers.

math.LO↗
arXiv2015

On the reducibility of isomorphism relations

We study the Borel reducibility of isomorphism relations in the generalized Baire space $κ^κ$. In the main result we show for inaccessible $κ$, that if $T$ is a classifiable theory and $T'$ is stable with OCP, then the isomorphism of models of $T$ is Borel reducible to the isomorphism of models of $T'$.

math.LO↗
arXiv2015

On model theory of covers of algebraically closed fields

We study covers of the multiplicative group of an algebraically closed field as quasiminimal pregeometry structures and prove that they satisfy the axioms for Zariski-like structures presented in \cite{lisuriart}, section 4. These axioms are intended to generalize the concept of a Zariski geometry into a non-elementary context. In the axiomatization, it is required that for a structure $\M$, there is, for each $n$, a collection of subsets of $\M^n$, that we call the \emph{irreducible sets}, satisfying certain properties. These conditions are generalizations of some qualities of irreducible closed sets in the Zariski geometry context. They state that some basic properties of closed sets (in the Zariski geometry context) are satisfied and that specializations behave nicely enough. They also ensure that there are some traces of Compactness even though we are working in a non-elementary context.

math.LO↗
arXiv2014

On Borel Reducibility in Generalised Baire Space

In this paper we study the Borel reducibility of Borel equivalence relations, including some orbit equivalence relations, on the generalised Baire space $κ^κ$ for an uncountable $κ$ with the property $κ^{<κ}=κ$. The theory looks quite different from its classical counterpart where $κ=ω$, although some basic theorems do generalise.

math.LO↗
arXiv2013

Quasiminimal structures and excellence

We show that the excellence axiom in the definition of Zilber's quasiminimal excellent classes is redundant, in that it follows from the other axioms. This substantially simplifies a number of categoricity proofs.

math.LO↗
arXiv2013

On compactness of logics that can express properties of symmetry or connectivity

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 prove that for a number of natural properties P speaking about automorphism groups or connectivity, every logic which is at least as strong as first-order logic and can express P fails to have the compactness property. We also give an example of a logic that extends first-order logic, has the compactness property and can express the property "the cardinality of the automorphism group is at most $2^{\aleph_0}$".

math.LO↗
arXiv2012

On Σ^1_1-complete Equivalence Relations on the Generalized Baire Space

Working with uncountable structures of fixed cardinality, we investigate the complexity of certain equivalence relations and show that if V = L, then many of them are Σ^1_1-complete, in particular the isomorphism relation of dense linear orders. Then we show that it is undecidable in ZFC whether or not the isomorphism relation of a certain well behaved theory (stable, NDOP, NOTOP) is Σ^1_1-complete (it is, if V = L, but can be forced not to be).

math.LO↗
arXiv2012

Borel* Sets in the Generalised Baire Space

We start by giving a survey to the theory of Borel*(κ) sets in the generalized Baire space Baire(κ) = κ^κ. In particular we look at the relation of this complexity class to other complexity classes which we denote by Borel(κ), Δ^1_1(κ) and Σ^1_1(κ) and the connections between Borel*(κ)-sets and the infinitely deep language M_{κ^+κ}. In the end of the paper we prove the consistency of Borel*(κ) \ne Σ^1_1(κ).

math.LO↗
arXiv2012

On Second-order Characterizability

We investigate the extent of second order characterizable structures by extending Shelah's Main Gap dichotomy to second order logic. For this end we consider a countable complete first order theory T. We show that all sufficiently large models of T have a characterization up to isomorphism in the extension of second order logic obtained by adding a little bit of infinitary logic if and only if T is shallow superstable with NDOP and NOTOP. Our result relies on cardinal arithmetic assumptions. Under weaker assumptions we get consistency results or alternatively results about second order logic with Henkin semantics.

math.LO↗
arXiv2004

Interpreting groups and fields in some nonelementary classes

This paper is concerned with extensions of geometric stability theory to some nonelementary classes. We prove the following theorem: Theorem: Let C be a large homogeneous model of a stable diagram D. Let p, q in S_D(A), where p is quasiminimal and q unbounded. Let P=p(C) and Q=q(C). Suppose that there exists an integer n<omega such that dim(a_1...a_n/A cup C)=n, for any independent a_1,..., a_n in P and finite subset C subseteq Q, but dim(a_1...a_n a_{n+1}/A cup C) <= n, for some independent a_1,...,a_n,a_{n+1} in P and some finite subset C subseteq Q. Then C interprets a group G which acts on the geometry P' obtained from P. Furthermore, either C interprets a non-classical group, or n=1,2,3 and * If n=1 then G is abelian and acts regularly on P'. * If n=2 the action of G on P' is isomorphic to the affine action of K times K^* on the algebraically closed field K. * If n = 3 the action of G on P' is isomorphic to the action of PGL_2(K) on the projective line {P}^1(K) of the algebraically closed field K .

math.LO↗
arXiv2002

More on the Ehrenfencht-Fraisse game of length omega_1

Let A and B be two first order structures of the same relational vocabulary L. The Ehrenfeucht-Fraisse-game of length gamma of A and B denoted by EFG_gamma(A,B) is defined as follows: There are two players called for all and exists. First for all plays x_0 and then exists plays y_0. After this for all plays x_1, and exists plays y_1, and so on. Eventually a sequence <(x_beta,y_beta): beta has been played. The rules of the game say that both players have to play elements of A cup B. Moreover, if for all plays his x_beta in A (B), then exists has to play his y_beta in B (A). Thus the sequence < (x_beta,y_beta):beta determines a relation pi subseteq AxB. Player exists wins this round of the game if pi is a partial isomorphism. Otherwise for all wins. The game EFG_gamma^delta (A,B) is defined similarly except that the players play sequences of length<delta at a time. Theorem 1: The following statements are equiconsistent relative to ZFC: (A) There is a weakly compact cardinal. (B) CH and EF_{omega_1}(A,B) is determined for all models A,B of cardinality aleph_2 . Theorem 2: Assume that 2^omega <2^{omega_3} and T is a countable complete first order theory. Suppose that one of (i)-(iii) below holds. Then there are A,B models T of power omega_3 such that for all cardinals 1<theta<=omega_3, EF^theta_{omega_1}(A,B) is non-determined. [(i)] T is unstable. [(ii)] T is superstable with DOP or OTOP. [(iii)] T is stable and unsuperstable and 2^omega <= omega_3.

math.LO↗