相关论文: Carlson's <_1-relation on the class of epsilon num…

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…

Local-order-invariant (first-order) logic is an extension of first-order logic where formulae have access to a ternary local order relation on the Gaifman graph, provided that the truth value does not depend on the specific order relation…

We prove a compact embedding theorem in a class of spaces of piecewise H1 functions subordinated to a class of shape regular, but not necessarily quasi-uniform triangulations of a polygonal domain. This result generalizes the…

The class of abelian $p$-groups are an example of some very interesting phenomena in computable structure theory. We will give an elementary first-order theory $T_p$ whose models are each bi-interpretable with the disjoint union of an…

An order relation for contractions on a Hilbert space can be introduced by stating that $A\preccurlyeq B$ if and only $A$ is unitarily equivalent to the restriction of $B$ to an invariant subspace. We discuss the equivalence classes…

We develop the abstract framework for a proof-theoretic analysis of theories with scope beyond ordinal numbers, resulting in an analog of Ordinal Analysis aimed at the study of theorems of complexity $\Pi^1_2$. This is done by replacing the…

We introduce a family of $C^*$-correspondences $X_\alpha$ naturally associated to every ordinal graph $\Lambda$. When $\Lambda$ is a directed graph, $X_0$ is isomorphic to the usual $C^*$-correspondence associated to a graph. We show that…

The structure ${\cal C}_2:=(1^\infty,\le,\le_1,\le_2)$, introduced and first analyzed in Carlson and Wilken 2012 (APAL), is shown to be elementary recursive. Here, $1^\infty$ denotes the proof-theoretic ordinal of the fragment…

We study the approachability ideal I[\kappa^+] in the context of large cardinals properties of the regular cardinals below a singular \kappa. As a guiding example consider the approachability ideal I[\aleph_{\omega+1}] assuming that…

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…

Clausen predicted that Chevalley's id\`{e}le class group of a number field $F$ appears as the first $K$-group of the category of locally compact $F$-vector spaces. This has turned out to be true, and even generalizes to the higher…

In this note we study a counterpart in predicate logic of the notion of 'logical friendliness', introduced into propositional logic in Makinson (2007). The result is a new consequence relation for predicate languages using first-order…

In this note we give a simplified ordinal analysis of first-order reflection. An ordinal notation system $OT$ is introduced based on $\psi$-functions. Provable $\Sigma_{1}$-sentences on $L_{\omega_{1}^{CK}}$ are bounded through…

We provide analogues of the results from [FMR11, CMMR13] in the reference list (which correspond to the case $\kappa = \omega$) for arbitrary $\kappa$-Souslin quasi-orders on any Polish space, for $\kappa$ an infinite cardinal smaller than…

We isolate here a wide class of well founded orders called tame orders and show that each such order of cardinality at most $\kappa$ can be realized as the Mitchell order on a measurable cardinal $\kappa$, from a consistency assumption…

In this paper we give an overview of an essential part of a Pi^0_1 ordinal analysis of Peano Arithmetic (PA) as presented by Beklemishev. This analysis is mainly performed within the polymodal provability logic GLP. We reflect on ways of…

For $n<\omega$, we say that the $\Pi^1_n$-reflection principle holds at $\kappa$ and write $\text{Refl}_n(\kappa)$ if and only if $\kappa$ is a $\Pi^1_n$-indescribable cardinal and every $\Pi^1_n$-indescribable subset of $\kappa$ has a…

Given a weakly compact cardinal $\kappa$, we give an axiomatization of intuitionistic first-order logic over $\mathcal{L}_{\kappa^+, \kappa}$ and prove it is sound and complete with respect to Kripke models. As a consequence we get the…

In this paper, we show how a construction of an implicit complexity model can be implemented using concepts coming from the core of von Neumann algebras. Namely, our aim is to gain an understanding of classical computation in terms of the…

We investigate the class of compact spaces which are embeddable into a power of the real line $R^\kappa$ in such a way that c_0(\kappa) is dense in the image. We show that this is a proper subclass of the class of Valdivia, even when…