中文
相关论文

相关论文: Stationary sets and infinitary logic

200 篇论文

We investigate the relationship between axiomatic set theory and the first-order theory of homeomorphism groups of manifolds in the language of group theory, concentrating on first-order rigidity and type versus conjugacy. We prove that…

We demonstrate that any $\Pi_\alpha$ sentence of the infinitary logic $L_{\omega_1 \omega}$ extending the theory of linear orderings has a model with a $\Pi_{\alpha+4}$ Scott sentence and hence of Scott rank at most $\alpha+3$. In other…

逻辑 · 数学 2025-05-02 David Gonzalez , Matthew Harrison-Trainor

We address a problem connected to the unfolding semantics of functional programming languages: give a useful characterization of those infinite lambda-terms that are lambda_{letrec}-expressible in the sense that they arise as infinite…

编程语言 · 计算机科学 2013-05-28 Clemens Grabmayer , Jan Rochel

For two derived equivalent $k$-algebras $\bar\Lambda$ and $\bar\Gamma$, we introduce a correspondence between $\OO$-orders reducing to $\bar\Lambda$ and $\OO$-orders reducing to $\bar\Gamma$. We outline how this may be used to transfer…

表示论 · 数学 2012-02-13 Florian Eisele

We generalize to the relations $(\lambda, \mu) \stackrel{\kappa}{\Rightarrow} (\lambda', \mu')$ and $\alm (\lambda, \mu) \stackrel{\kappa}{\Rightarrow} \alm (\lambda', \mu')$ some results obtained in Parts II and IV. We also present a…

逻辑 · 数学 2009-03-30 Paolo Lipparini

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…

逻辑 · 数学 2020-04-21 Gabriel Fernandes , Miguel Moreno , Assaf Rinot

Given a row-finite $k$-graph $\Lambda$ with no sources we investigate the $K$-theory of the higher rank graph $C^*$-algebra, $C^*(\Lambda)$. When $k=2$ we are able to give explicit formulae to calculate the $K$-groups of $C^*(\Lambda)$. The…

算子代数 · 数学 2007-12-18 D. Gwion Evans

Hellsten \cite{MR2026390} proved that when $\kappa$ is $\Pi^1_n$-indescribable, the \emph{$n$-club} subsets of $\kappa$ provide a filter base for the $\Pi^1_n$-indescribability ideal, and hence can also be used to give a characterization of…

逻辑 · 数学 2020-01-31 Brent Cody , Victoria Gitman , Chris Lambie-Hanson

Given a $k$-graph $\Lambda$ and an element $p$ of $\NN^k$, we define the dual $k$-graph, $p\Lambda$. We show that when $\Lambda$ is row-finite and has no sources, the $C^*$-algebras $C^*(\Lambda)$ and $C^*(p\Lambda)$ coincide. We use this…

算子代数 · 数学 2007-05-23 Stephen Allen , David Pask , Aidan Sims

Using Koszmider's strongly unbounded functions, we show the following consistency result: Suppose that $\kappa,\lambda$ are infinite cardinals such that $\kappa^{+++} \leq \lambda$, $\kappa^{<\kappa}=\kappa$ and $2^{\kappa}= \kappa^+$, and…

逻辑 · 数学 2015-03-17 Juan Carlos Martinez , Lajos Soukup

Given a finite dimensional algebra $\Lambda$, we show that a frequently satisfied finiteness condition for the category ${\cal P}^{\infty}(\Lambda\rm{-mod})$ of all finitely generated (left) $\Lambda$-modules of finite projective dimension,…

表示论 · 数学 2014-07-10 B. Huisgen-Zimmermann , S. O. Smalø

We give the first (ZFC) dividing line in Keisler's order among the unstable theories, specifically among the simple unstable theories. That is, for any infinite cardinal $\lambda$ for which there is $\mu < \lambda \leq 2^\mu$, we construct…

逻辑 · 数学 2012-08-13 M. Malliaris , S. Shelah

Model checking properties are often described by means of finite automata. Any particular such automaton divides the set of infinite trees into finitely many classes, according to which state has an infinite run. Building the full type…

计算机科学中的逻辑 · 计算机科学 2015-07-01 Klaus Aehlig

We prove that the theory of the models constructible using finitely many cofinality quantifiers - $C_{\lambda_{1},...,\lambda_{n}}^{*}$ and $C_{<\lambda_{1},...,<\lambda_{n}}^{*}$ for $\lambda_{1},...,\lambda_{n}$ regular cardinals - is…

逻辑 · 数学 2021-12-03 Ur Ya'ar

We introduce more properties of forcing notions which imply that their lambda-support iterations are lambda-proper, where lambda is an inaccessible cardinal. This paper is a direct continuation of section A.2 of math.LO/0210205. As an…

逻辑 · 数学 2013-01-04 Andrzej Roslanowski , Saharon Shelah

Suppose $\Lambda$ is a discrete infinite set of nonnegative real numbers. We say that $ {\Lambda}$ is type $1$ if the series $s(x)=\sum_{\lambda\in\Lambda}f(x+\lambda)$ satisfies a zero-one law. This means that for any non-negative…

经典分析与常微分方程 · 数学 2018-06-01 Zoltán Buczolich , Bruce Hanson , Balázs Maga , Gáspár Vértesy

A characteristic result is that if 2^{aleph_0}< mu < mu^+< lambda = cf(lambda)< mu^{aleph_0}, then among the separable reduced p-groups of cardinality lambda which are (< lambda)-stable there is no universal one.

逻辑 · 数学 2009-09-25 Saharon Shelah

We analyze $\mathrm{C}^\ast$-algebras, particularly AF-algebras, and their $K_0$-groups in the context of the infinitary logic $\mathcal{L}_{\omega_1 \omega}$. Given two separable unital AF-algebras $A$ and $B$, and considering their…

Let 2<n\leq l<m< \omega. Let L_n denote first order logic restricted to the first n variables. We show that the omitting types theorem fails dramatically for the n--variable fragments of first order logic with respect to clique guarded…

逻辑 · 数学 2015-04-24 Tarek Sayed Ahmed

We show that the ordering of the Hanf number of L_{omega, omega}(wo) (well ordering), L^c_{omega, omega} (quantification on countable sets), L_{omega, omega}(aa) (stationary logic) and second order logic, have no more restraints provable in…

逻辑 · 数学 2013-10-22 Saharon Shelah