English
Related papers

Related papers: On completions, neat embeddings and omittings type…

200 papers

In this paper we prove the following theorem. Let L/\Q_p be a finite extension with ring of integers O_L and maximal ideal lambda. Theorem 1. Suppose that p >= 5. Suppose also that \rho:G_\Q -> GL_2(O_L) is a continuous representation…

Number Theory · Mathematics 2016-09-07 Kevin Buzzard , Richard Taylor

Our "long term and large scale" aim is to characterize the first order theories T (at least the countable ones) such that: for every ordinal alpha there lambda,M_1,M_2 such that M_1,M_2 are non-isomorphic models of T of cardinality lambda…

Logic · Mathematics 2017-08-08 Saharon Shelah

Let $\Lambda$ be a finite dimensional algebra over an algebraically closed field. Criteria are given which characterize existence of a fine or coarse moduli space classifying, up to isomorphism, the representations of $\Lambda$ with fixed…

Representation Theory · Mathematics 2014-07-11 Birge Huisgen-Zimmermann

We use high girth, high chromatic number hypergraphs to show that there are finite models of the equational theory of the semiring of nonnegative integers whose equational theory has no finite axiomatisation, and show this also holds if…

Logic · Mathematics 2026-02-12 Tumadhir Alsulami , Marcel Jackson

Answering a question by Honsell and Plotkin, we show that there are two equations between lambda terms, the so-called subtractive equations, consistent with lambda calculus but not simultaneously satisfied in any partially ordered model…

Logic in Computer Science · Computer Science 2015-07-01 Antonino Salibra , Alberto Carraro

Let \phi be a first order formula and M be a countable model. \phi^M denotes the set of all assignments that satisfy \phi in M. Let M, N be countable models. A formula \phi distinguishes these models if |\phi^M|\neq |\phi^N|. We show that…

Logic · Mathematics 2013-04-04 Mohammed Assem , Tarek Sayed Ahmed

We use Monk like algebras to give a new proof that the classes of strongly representable relation algebras and finite dimensional cylindric algebras of dimension >2 are not elementary. Our construction is based on relation algebras have…

Logic · Mathematics 2013-05-21 Tarek Sayed Ahmed

For any truncated path algebra $\Lambda$ of a quiver, we classify, by way of representation-theoretic invariants, the irreducible components of the parametrizing varieties $\mathbf{Rep}_{\mathbf{d}}(\Lambda)$ of the $\Lambda$-modules with…

Representation Theory · Mathematics 2019-12-20 K. R. Goodearl , B. Huisgen-Zimmermann

We apply the recently developed technology of cofinality spectrum problems to prove a range of theorems in model theory. First, we prove that any model of Peano arithmetic is $\lambda$-saturated iff it has cofinality $\geq \lambda$ and the…

Logic · Mathematics 2015-03-31 M. Malliaris , S. Shelah

A longstanding open problem is whether there exists a non syntactical model of the untyped lambda-calculus whose theory is exactly the least lambda-theory (l-beta). In this paper we investigate the more general question of whether the…

Logic · Mathematics 2008-12-18 Chantal Berline , Giulio Manzonetto , Antonio Salibra

In this paper, we introduce a $\{\lambda_{1\to n-1}\}$-bracket and a distribution notion of an $n$-Lie conformal algebra. For any $n$-Lie conformal algebra $R$, there exists a series of associated infinite-dimensional linearly compact…

Mathematical Physics · Physics 2022-03-29 Mengjun Wang , Lipeng Luo , Zhixiang Wu

We show that the class of representable substitution algebras is characterized by a set of universal first order sentences. In addition, it is shown that a necessary and sufficient condition for a substitution algebra to be representable is…

Logic · Mathematics 2015-03-05 Norman Feldman

Assuming a large cardinal hypothesis, Laver gave a representation of the monogenerated free left distributive algebra (LDA) using elementary embeddings and used this representation to prove many algebraic results. Some of these results were…

Logic · Mathematics 2026-04-13 Scott Cramer , Meng-Che "Turbo" Ho , Sheila K. Miller Edwards , Nam Trang

This paper is about omitting types in logic of metric structures introduced by Ben Yaacov, Berenstein, Henson and Usvyatsov. While a complete type is omissible in some model of a countable complete theory if and only if it is not principal,…

Logic · Mathematics 2017-11-28 Ilijas Farah , Menachem Magidor

Let $G$ be a reductive algebraic group over a $p$-adic field or number field $K$, and let $V$ be a $K$-linear faithful representation of $G$. A lattice $\Lambda$ in the vector space $V$ defines a model $\hat{G}_{\Lambda}$ of $G$ over…

Algebraic Geometry · Mathematics 2022-06-03 Milan Lopuhaä-Zwakenberg

We introduce the notion of a `pure` Abstract Elementary Class to block trivial counterexamples. We study classes of models of bipartite graphs and show: Main Theorem (cf. Theorem 3.5.2 and Corollary 3.5.6): If $(\lambda_i : i \le…

Logic · Mathematics 2015-02-20 John T. Baldwin , Martin Koerwien , Ioannis Souldatos

We consider countable so-called rich subsemigroups of (\omega\omega,\circ); each such semigroup $T$ gives a variety CPEA_T that is axiomatizable by a finite schema of equations taken in a countable subsignature of that of \omega-dimensional…

Logic · Mathematics 2015-03-03 Tarek Sayed Ahmed

We prove "untyping" theorems: in some typed theories (semirings, Kleene algebras, residuated lattices, involutive residuated lattices), typed equations can be derived from the underlying untyped equations. As a consequence, the…

Logic in Computer Science · Computer Science 2015-07-01 Damien Pous

We investigate a class of nominal algebraic Henkin-style models for the simply typed lambda-calculus in which variables map to names in the denotation and lambda-abstraction maps to a (non-functional) name-abstraction operation. The…

Logic in Computer Science · Computer Science 2011-11-02 Murdoch J. Gabbay , Dominic P. Mulligan

A Hilbert-type axiomatic rejection $\mathbf{HAR}$ for the propositional fragment $\mathbf{L_1}$ of Le\'{s}niewski's ontology is proposed. Also a Gentzen-type axiomatic rejection $\mathbf{GAR}$ of $\mathbf{L_1}$ is proposed. Models for…

Logic · Mathematics 2021-08-19 Takao Inoué , Arata Ishimoto , Mitsunori Kobayashi