中文
相关论文

相关论文: Classical and Effective Descriptive Complexities o…

200 篇论文

We consider several formalizations in the language of second-order arithmetic of "The formula $\phi$ is a theorem of $\omega$-logic", including some which have been studied in the literature and a new variant defined via a least fixed…

逻辑 · 数学 2022-03-23 David Fernández-Duque

A fundamental result proved by Bourgain, Fremlin and Talagrand states that the space $B_1(M)$ of Baire one functions over a Polish space $M$ is an angelic space. Stegall extended this result by showing that the class $B_1(M,E)$ of Baire one…

一般拓扑 · 数学 2019-05-01 Saak Gabriyelyan

For which choices of $X,Y,Z\in\{\Sigma^1_1,\Pi^1_1\}$ does no sufficiently strong $X$-sound and $Y$-definable extension theory prove its own $Z$-soundness? We give a complete answer, thereby delimiting the generalizations of G\"odel's…

逻辑 · 数学 2026-01-28 Henry Towsner , James Walsh

We study the complex powers $A^{z}$ of an elliptic, strictly positive pseudodifferential operator $A$ using an axiomatic method that combines the approaches of Guillemin and Seeley. In particular, we introduce a class of algebras,…

算子代数 · 数学 2007-05-23 Bernd Ammann , Robert Lauter , Victor Nistor , Andras Vasy

In this paper, we determine the descriptive complexity of subsets of the Polish space of marked groups defined by various group theoretic properties. In particular, using Grigorchuk groups, we establish that the sets of solvable groups,…

群论 · 数学 2020-11-04 Mustafa Gökhan Benli , Burak Kaya

Polymodal provability logic GLP is incomplete w.r.t. Kripke frames. It is known to be complete w.r.t. topological semantics, where the diamond modalities correspond to topological derivative operations. However, the topologies needed for…

逻辑 · 数学 2024-07-16 Lev D. Beklemishev , Yunsong Wang

We calculate the possible Scott ranks of countable models of Peano arithmetic. We show that no non-standard model can have Scott rank less than $\omega$ and that non-standard models of true arithmetic must have Scott rank greater than…

逻辑 · 数学 2022-08-04 Antonio Montalbán , Dino Rossegger

This paper answers three questions posed by the first author. In Theorem 2.6 we show that the family of strong measure zero subsets of {}^{omega_1}2 is 2^{aleph_1}-additive under GMA and CH. In Theorem 3.1 we prove that the generalized…

逻辑 · 数学 2009-09-25 Aapo Halko , Saharon Shelah

We determine the exact Borel class of the points whose iterates under $\exp(z)+a$ tend to infinity. We also prove that the sets of non-escaping Julia points for many of these functions are topologically equivalent.

一般拓扑 · 数学 2024-04-02 David S. Lipham

We build a new spectrum of recursive models (SRM(T)) of a strongly minimal theory. This theory is non-disintegrated, flat, model complete, and in a language with a finite signature.

逻辑 · 数学 2021-04-30 Uri Andrews , Omer Mermelstein

Undecidability of various properties of first order term rewriting systems is well-known. An undecidable property can be classified by the complexity of the formula defining it. This gives rise to a hierarchy of distinct levels of…

计算机科学中的逻辑 · 计算机科学 2009-03-02 Joerg Endrullis , Herman Geuvers , Hans Zantema

We show that, if a simple $C^{*}$-algebra $A$ is topologically finite-dimensional in a suitable sense, then not only $K_{0}(A)$ has certain good properties, but $A$ is even accessible to Elliott's classification program. More precisely, we…

算子代数 · 数学 2007-05-23 Wilhelm Winter

We investigate the statement "the order topology of every countable complete linear order is compact" in the framework of reverse mathematics, and we find that the statement's strength depends on the precise formulation of compactness. If…

逻辑 · 数学 2019-08-01 Paul Shafer

$\mathop{\rm rp}\nolimits ({\mathbb B})$ denotes the reduced power ${\mathbb B}^\omega /\Phi$ of a Boolean algebra ${\mathbb B}$, where $\Phi$ is the Fr\'{e}chet filter $\Phi$ on $\omega$. We investigate iterated reduced powers…

逻辑 · 数学 2024-03-27 Miloš S. Kurilić

The class of omega-regular languages provides a robust specification language in verification. Every omega-regular condition can be decomposed into a safety part and a liveness part. The liveness part ensures that something good happens…

形式语言与自动机理论 · 计算机科学 2012-02-03 Krishnendu Chatterjee , Nathanaël Fijalkow

We analyse the complexity of the class of (special) Aronszajn, Suslin and Kurepa trees in the projective hierarchy of the higher Baire-space $\omega_1^{\omega_1}$. First, we will show that none of these classes have the Baire property…

逻辑 · 数学 2019-06-04 Sy-David Friedman , Dániel T. Soukup

Let $W$ be a finite reflection group associated with a root system $R$ in $\mathbb R^d$. Let $C_+$ denote a positive Weyl chamber. Consider an open subset $\Omega$ of $\mathbb R^d$, symmetric with respect to reflections from $W$. Let…

泛函分析 · 数学 2024-01-09 Krzysztof Stempak

This is an extended abstract presenting new results on the topological complexity of omega-powers (which are included in a paper "Classical and effective descriptive complexities of omega-powers" available from arXiv:0708.4176) and…

计算机科学中的逻辑 · 计算机科学 2008-09-11 Olivier Finkel , Dominique Lecomte

We prove strong completeness results for some modal logics with the universal modality, with respect to their topological semantics over 0-dimensional dense-in-themselves metric spaces. We also use failure of compactness to show that, for…

逻辑 · 数学 2020-08-12 Robert Goldblatt , Ian Hodkinson

Given a bounded domain $\Omega \subset {\Bbb R}^d$ with positive measure and a finite set $A=\{a^1, a^2, \dots, a^d\}$, we say that the set ${\mathcal E}(A)={\{e^{2 \pi i x \cdot a^j}\}}_{a^j \in A}$ is a complete exponential system if for…

经典分析与常微分方程 · 数学 2020-07-17 Alex Iosevich , Azita Mayeli