中文
相关论文

相关论文: David's trick

200 篇论文

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 \Sigma^1_1-complete, in particular the isomorphism relation of dense…

逻辑 · 数学 2012-09-19 Tapani Hyttinen , Vadim Kulikov

The modal systems S1--S3 were introduced by C. I. Lewis as logics for strict implication. While there are Kripke semantics for S2 and S3, there is no known natural semantics for S1. We extend S1 by a Substitution Principle SP which…

计算机科学中的逻辑 · 计算机科学 2014-12-09 Steffen Lewitzka

Vardanyan's Theorems state that $\mathsf{QPL}(\mathsf{PA})$ - the quantified provability logic of Peano Arithmetic - is $\Pi^0_2$ complete, and in particular that this already holds when the language is restricted to a single unary…

逻辑 · 数学 2023-12-20 Ana de Almeida Borges , Joost J. Joosten

The thesis of this paper is that truth-relevant logic is a better foundation for mathematics than classical logic. It is a system proposed by Richard Diaz in 1981. In a certain sense t-relevant logic is based on Kleene strong tables. These…

逻辑 · 数学 2023-02-14 X. Y. Newberry

We prove the first rigidity and classification theorems for crossed product von Neumann algebras given by actions of non-discrete, locally compact groups. We prove that for arbitrary free probability measure preserving actions of connected…

算子代数 · 数学 2018-07-20 Arnaud Brothier , Tobe Deprez , Stefaan Vaes

We develop a toolbox for forcing over arbitrary models of set theory without the axiom of choice. In particular, we introduce a variant of the countable chain condition and prove an iteration theorem that applies to many classical forcings…

逻辑 · 数学 2023-01-02 Daisuke Ikegami , Philipp Schlicht

We study the logic obtained by endowing the language of first-order arithmetic with second-order measure quantifiers. This new kind of quantification allows us to express that the argument formula is true in a certain portion of all…

计算机科学中的逻辑 · 计算机科学 2021-04-27 Melissa Antonelli , Ugo Dal Lago , Paolo Pistone

We show that the Hrushovski-\fraisse limit of certain classes of trees lead to strictly superstable theories of various U-ranks. In fact, for each $ \alpha\in\omega+1\backslash\{0\} $ we introduce a strictly superstable theory of U-rank $…

逻辑 · 数学 2025-10-16 Ali N. Valizadeh , Massoud Pourmahdian

An essentially free group action of $\Gamma$ on $(X,\mu)$ is called W*-superrigid if the crossed product von Neumann algebra $L^\infty(X) \rtimes \Gamma$ completely remembers the group $\Gamma$ and its action on $(X,\mu)$. We prove…

算子代数 · 数学 2023-07-11 Daniel Drimbe , Stefaan Vaes

For $i=1,\ldots,k$, let $\mathbf{G}_i$ be a connected, simply connected, semisimple algebraic group over some local field $\kappa_i$ of characteristic zero. Let $G_i=\mathbf{G}_i(\kappa_i)$ be the $\kappa_i$-points of $\mathbf{G}_i$ and…

动力系统 · 数学 2026-03-24 Filippo Sarti , Alessio Savini

We discuss the application of the determinantal method to the proof of the Riemann hypothesis. We start from the fact that, if a certain doubly infinite set of determinants are all positive, then the hypothesis is true. This approach…

数论 · 数学 2011-11-07 John Nuttall

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…

逻辑 · 数学 2015-03-10 Vera Koponen , Tapani Hyttinen

We use the theory of Kolyvagin systems to prove (most of) a refined class number formula conjectured by Darmon. We show that for every odd prime $p$, each side of Darmon's conjectured formula (indexed by positive integers $n$) is "almost" a…

数论 · 数学 2019-02-20 Barry Mazur , Karl Rubin

A decidability proof for bisimulation equivalence of first-order grammars (finite sets of labelled rules for rewriting roots of first-order terms) is presented. The equivalence generalizes the DPDA (deterministic pushdown automata)…

计算机科学中的逻辑 · 计算机科学 2014-06-02 Petr Jancar

Recently, Moret\'o and Rizo proposed a conjecture, known as the Picky Conjecture, proposing new character correspondences extending the McKay Conjecture. We prove the Picky Conjecture for all quasi-simple groups of Lie type for non-defining…

表示论 · 数学 2025-10-22 Gunter Malle , A. A. Schaeffer Fry

In Team Semantics, a dependency notion is strongly first order if every sentence of the logic obtained by adding the corresponding atoms to First Order Logic is equivalent to some first order sentence. In this work it is shown that all…

逻辑 · 数学 2019-02-25 Pietro Galliani

We present a generalization of the standard In\"on\"u-Wigner contraction by rescaling not only the generators of a Lie superalgebra but also the arbitrary constants appearing in the components of the invariant tensor. The procedure…

高能物理 - 理论 · 物理学 2017-03-08 P. K. Concha , O. Fierro , E. K. Rodríguez

We prove an abstract compactness theorem for a family of generalized Seiberg-Witten equations in dimension three. This result recovers Taubes' compactness theorem for stable flat $\mathbf{P}\mathrm{SL}_2(\mathbf{C})$-connections as well as…

微分几何 · 数学 2022-02-02 Thomas Walpuski , Boyu Zhang

We show, assuming PD, that every complete finitely axiomatized second order theory with a countable model is categorical, but that there is, assuming again PD, a complete recursively axiomatized second order theory with a countable model…

逻辑 · 数学 2024-05-07 Tapio Saarinen , Jouko Väänänen , William Hugh Woodin

In this paper we prove general criticality criteria for operators $\Delta + V$ on manifolds with more than one end, where $V$ bounds the Ricci curvature, and a related spectral splitting theorem extending Cheeger-Gromoll's one. Our results…

微分几何 · 数学 2026-04-10 Giovanni Catino , Luciano Mari , Paolo Mastrolia , Alberto Roncoroni