中文
相关论文

相关论文: David's trick

200 篇论文

There have been many generalizations of Shoenfield's Theorem on the absoluteness of $\Sigma^1_2$ sentences between uncountable transitive models of $\mathrm{ZFC}$. One of the strongest versions currently known deals with $\Sigma^2_1$…

逻辑 · 数学 2007-05-23 W. Hugh Woodin

We present algorithms to classify isolated hypersurface singularities over the real numbers according to the classification by V.I. Arnold (Arnold et al., 1985). This first part covers the splitting lemma and the simple singularities; a…

代数几何 · 数学 2016-01-15 Magdaleen S. Marais , Andreas Steenpass

We extend a dichotomy between 1-basedness and supersimplicity proved in a previous paper. The generalization we get is to arbitrary language, with no restrictions on the topology (we do not demand type-definabilty of the open set in the…

逻辑 · 数学 2013-11-12 Ziv Shami

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…

计算机科学中的逻辑 · 计算机科学 2024-04-26 Hashimoto Go , Daniel Găină , Ionuţ Ţuţu

A new scheme for proving pseudoidentities from a given set {\Sigma} of pseudoidentities, which is clearly sound, is also shown to be complete in many instances, such as when {\Sigma} defines a locally finite variety, a pseudovariety of…

群论 · 数学 2019-03-18 Jorge Almeida , Ondřej Klíma

Assuming projective determinacy, we extend Spector's strong version of the Spector-Gandy Theorem to all odd levels of the projective hierarchy: Theorem. For every space $X$ which is a finite product of the natural numbers $N$ and Baire…

逻辑 · 数学 2022-02-09 Joan R. Moschovakis , Yiannis N. Moschovakis

W.H. Woodin showed that if $\kappa_1 < \cdots < \kappa_n$ are strong cardinals then two-step ${\bf\Sigma}^1_{n+3}$ generic absoluteness holds after collapsing $2^{2^{\kappa_n}}$ to be countable. We show that this number can be reduced to…

逻辑 · 数学 2018-07-09 Trevor M. Wilson

Dependence logic provides an elegant approach for introducing dependencies between variables into the object language of first-order logic. In [1] generalized quantifiers were introduced in this context. However, a satisfactory account was…

逻辑 · 数学 2024-04-29 Fredrik Engström

This paper undertakes a re-examination of Sir William Hamilton's doctrine of the quantification of the predicate. Hamilton's doctrine comprises two theses. First, the predicates of traditional syllogistic sentence-forms contain implicit…

计算机科学中的逻辑 · 计算机科学 2024-04-24 Ian Pratt-Hartmann

The present thesis represents developments in two main directions related to the simple Lie algebras. The first one is devoted to the representation theory of the simple Lie algebras. Specifically, we present recent results, which include…

数学物理 · 物理学 2022-07-12 Mane Avetisyan

We establish the decidability of the $\Sigma_2$ theory of both the arithmetic and hyperarithmetic degrees in the language of uppersemilattices i.e. the language with $\leq, 0$ and $\sqcup$. This is achieved by using Kumabe-Slaman forcing -…

逻辑 · 数学 2016-06-24 James Barnes

We study the relationship between Amoeba forcing (the partial order which generically adds a measure one set of random reals) and projective measurability. Given a universe V of set theory and a forcing notion P in V we say that V is…

逻辑 · 数学 2009-09-25 Jörg Brendle

We introduce a notion of semi-legendrian real submanifold in a complex manifold of dimension 3 and prove that real submanifolds of $\mathbb{C}^2$ can be uniquely lifted to $\mathbb{C}^3$. Then we deduce a complex duality between real…

几何拓扑 · 数学 2021-01-20 Olivier Thom

We develop formal theories of conversion for Church-style lambda-terms with Pi-types in first-order syntax using one-sorted variables names and Stoughton's multiple substitutions. We then formalize the Pure Type Systems along some…

计算机科学中的逻辑 · 计算机科学 2025-10-15 Sebastián Urciuoli

It is well known that the strong subadditivity theorem is hold for classical system, but it is very difficult to prove that it is hold for quantum system. The first proof of this theorem is due to Lieb by using the Lieb's theorem. Here we…

量子物理 · 物理学 2007-05-23 Yong-Jian Han , Yong-Sheng Zhang , Guang-Can Guo

Adding modular predicates yields a generalization of first-order logic FO over words. The expressive power of FO[<,MOD] with order comparison $x<y$ and predicates for $x \equiv i \mod n$ has been investigated by Barrington, Compton,…

形式语言与自动机理论 · 计算机科学 2014-07-02 Manfred Kufleitner , Tobias Walter

We prove that if every real belongs to a set generic extension of the constructible universe then every \Sigma_1^1 equivalence E on reals either admits a Delta_1^HC reduction to the equality on the set 2^{<\om_1} of all countable binary…

逻辑 · 数学 2018-08-22 Vladimir Kanovei

Assuming that there is no inner model with a strong cardinal, the following is shown: any subset of \omega_1 can be made \Delta^1_3 (in the codes) by a reasonable set-forcing; there is a reasonable set-generic extension with a \Delta^1_3…

逻辑 · 数学 2009-09-25 Ralf Schindler

The prepotential of N=2* supersymmetric theories with unitary gauge groups in an Omega-background satisfies a modular anomaly equation that can be recursively solved order by order in an expansion for small mass. By requiring that S-duality…

高能物理 - 理论 · 物理学 2015-10-23 M. Billo , M. Frau , F. Fucito , A. Lerda , J. F. Morales

In this paper we characterize the congruence associated to the direct sum of all irreducible representations of a finite semigroup over an arbitrary field, generalizing results of Rhodes for the field of complex numbers. Applications are…

‹ 上一页 1 2 3 10 下一页 ›