中文
相关论文

相关论文: When first order T has limit models

200 篇论文

This paper enlarges classical syllogistic logic with assertions having to do with comparisons between the sizes of sets. So it concerns a logical system whose sentences are of the following forms: {\sf All $x$ are $y$} and {\sf Some $x$ are…

逻辑 · 数学 2020-03-25 Lawrence S. Moss , Selçuk Topal

In this article we show that hybrid type-logical grammars are a fragment of first-order linear logic. This embedding result has several important consequences: it not only provides a simple new proof theory for the calculus, thereby…

计算机科学中的逻辑 · 计算机科学 2014-05-27 Richard Moot

We discuss the solvability of an infinite system of first order ordinary differential equations on the half line, subject to nonlocal initial conditions. The main result states that if the nonlinearities possess a suitable "sub-linear"…

经典分析与常微分方程 · 数学 2015-03-25 Gennaro Infante , Petru Jebelean , Fadila Madjidi

It is known that there exists a first-order sentence that holds in a finite group if and only if the group is soluble. Here it is shown that the corresponding statements with 'solubility' replaced by 'nilpotence' and 'perfectness', among…

群论 · 数学 2021-05-11 Yves Cornulier , John S. Wilson

We address the problem of characterizing $H$-coloring problems that are first-order definable on a fixed class of relational structures. In this context, we give several characterizations of a homomorphism dualities arising in a class of…

组合数学 · 数学 2014-06-10 Jaroslav Nesetril , Patrice Ossona De Mendez

The primary purpose of this article is to show that a certain natural set of axioms yields a completeness result for continuous first-order logic. In particular, we show that in continuous first-order logic a set of formulae is (completely)…

逻辑 · 数学 2014-02-10 Itaï Ben Yaacov , Arthur Paul Pedersen

An infinite cardinal $\lambda$ is called Fr\'echet if the Fr\'echet filter on $\lambda$ extends to a countably complete ultrafilter. We investigate the relationship between Fr\'echet cardinals and strongly compact cardinals under a…

逻辑 · 数学 2018-10-12 Gabriel Goldberg

A usual dichotomy is that in many cases, reasonably definable sets, satisfy the CH, i.e. if they are uncountable they have cardinality continuum. A strong dichotomy is when: if the cardinality is infinite it is continuum as in [Sh:273]. We…

逻辑 · 数学 2016-09-07 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 first-order theory has the Schroder-Bernstein property if any two of its models that are elementarily bi-embeddable are isomorphic. We prove that if a countable theory T has the Schroder-Bernstein property then it is classifiable (it is…

逻辑 · 数学 2007-05-23 John Goodrick

Model theoretic results such as Characterization and Definability give important information about different logics. It is well known that the proofs of those results for several modal logics have, somehow, the same 'taste'. A general proof…

计算机科学中的逻辑 · 计算机科学 2010-11-23 Facundo Carreiro

We point out a gap in Shelah's proof of the following result: $\mathbf{Claim}$ Let $K$ be an abstract elementary class categorical in unboundedly many cardinals. Then there exists a cardinal $\lambda$ such that whenever $M, N \in K$ have…

逻辑 · 数学 2015-10-19 Will Boney , Sebastien Vasey

We present a self-contained analysis of infinity from two mathematical perspectives: set theory and algebra. We begin with cardinal and ordinal numbers, examining deep questions such as the continuum hypothesis, along with foundational…

历史与综述 · 数学 2025-05-16 Noah Betz

Formalisms based on temporal logics interpreted over finite strict linear orders, known in the literature as finite traces, have been used for temporal specification in automated planning, process modelling, (runtime) verification and…

计算机科学中的逻辑 · 计算机科学 2022-02-02 Alessandro Artale , Andrea Mazzullo , Ana Ozaki

We study a class of first-order theories whose complete quantifier-free types with one free variable either have a trivial positive part or are isolated by a positive quantifier-free formula--plus a few other technical requirements. The…

逻辑 · 数学 2009-06-01 Domenico Zambella

Conditional logics play an important role in recent attempts to formulate theories of default reasoning. This paper investigates first-order conditional logic. We show that, as for first-order probabilistic logic, it is important not to…

人工智能 · 计算机科学 2009-09-25 Nir Friedman , Joseph Y. Halpern , Daphne Koller

Motivated by the theory of graph limits, we introduce and study the convergence and limits of linear representations of finite groups over finite fields. The limit objects are infinite dimensional representations of free groups in…

环与代数 · 数学 2015-11-20 Gabor Elek

For many classes of models, there are universal members in any cardinal $\lambda$ which "essentially satisfies GCH", i.e. $\lambda = 2^{< \lambda}$, in particular for the class of a complete first order $T$ (well, if at least $\lambda >…

逻辑 · 数学 2026-03-05 Saharon Shelah

We study field theories in the limit that a compactified dimension becomes lightlike. In almost all cases the amplitudes at each order of perturbation theory diverge in the limit, due to strong interactions among the longitudinal zero…

高能物理 - 理论 · 物理学 2009-10-09 Simeon Hellerman , Joseph Polchinski

Transfinite set theory including the axiom of choice supplies the following basic theorems: (1) Mappings between infinite sets can always be completed, such that at least one of the sets is exhausted. (2) The real numbers can be well…

综合数学 · 数学 2007-05-23 W. Mueckenheim