English
Related papers

Related papers: A Finite Model Property for Intersection Types

200 papers

We make two contributions to the study of theory combination in satisfiability modulo theories. The first is a table of examples for the combinations of the most common model-theoretic properties in theory combination, namely stable…

Logic in Computer Science · Computer Science 2023-05-05 Guilherme Vicentin de Toledo , Yoni Zohar , Clark Barrett

In this paper we study the Lefschetz properties of monomial complete intersections in positive characteristic. We give a complete classification of the strong Lefschetz property when the number of variables is at least three, which proves a…

Commutative Algebra · Mathematics 2019-05-07 Samuel Lundqvist , Lisa Nicklasson

We consider the problem of characterizing isomorphisms of types, or, equivalently, constructive cardinality of sets, in the simultaneous presence of disjoint unions, Cartesian products, and exponentials. Mostly relying on results about…

Logic in Computer Science · Computer Science 2014-11-04 Danko Ilik

We introduce an intersection type system for the lambda-mu calculus that is invariant under subject reduction and expansion. The system is obtained by describing Streicher and Reus's denotational model of continuations in the category of…

Logic in Computer Science · Computer Science 2019-03-14 Steffen van Bakel , Franco Barbanera , Ugo de'Liguoro

Restriction is a natural quasi-order on $d$-way tensors. We establish a remarkable aspect of this quasi-order in the case of tensors over a fixed finite field -- namely, that it is a well-quasi-order: it admits no infinite antichains and no…

Algebraic Geometry · Mathematics 2025-09-03 Andreas Blatter , Jan Draisma , Filip Rupniewski

We introduce the notion of a "category with path objects", as a slight strengthening of Kenneth Brown's classic notion of a "category of fibrant objects". We develop the basic properties of such a category and its associated homotopy…

Category Theory · Mathematics 2017-06-21 Benno van den Berg , Ieke Moerdijk

We discuss the finite-size properties of a simple integrable quantum field theory in 1+1 dimensions with non-trivial boundary conditions. Novel off-critical identities between cylinder partition functions of models with differing boundary…

High Energy Physics - Theory · Physics 2009-10-16 P. Dorey , M. Pillin , A. Pocklington , I. Runkel , R. Tateo , G. M. T. Watts

In the parlance of relational structures, the Finite Ramsey Theorem states that the class of all finite chains has the Ramsey property. A classical result of J. Ne\v{s}et\v{r}il and V. R\"{o}dl claims that the class of all finite posets…

Combinatorics · Mathematics 2019-04-09 Nemanja Draganić , Dragan Mašulović

Based on an idea of Y. P\'eresse and some results of Maltcev, Mitchell and Ru\v{s}kuc, we present sufficient conditions under which the endomorphism monoid of a countably infinite ultrahomogeneous first-order structure has the Bergman…

Group Theory · Mathematics 2014-03-10 Igor Dolinka

We relate a balancing property of letters for bi-infinite sequences to the invariance of the resulting 1-dimensional tiling dynamics under changes in the lengths of the tiles. If the language of the sequence space is finitely balanced, then…

Dynamical Systems · Mathematics 2015-03-25 Lorenzo Sadun

We classify the homogeneous finite-dimensional permutation structures, i.e., homogeneous structures in a language of finitely many linear orders, giving a nearly complete answer to a question of Cameron, and confirming the classification…

Logic · Mathematics 2020-02-26 Samuel Braunfeld , Pierre Simon

New homotopy invariant finiteness conditions on modules over commutative rings are introduced, and their properties are studied systematically. A number of finiteness results for classical homological invariants like flat dimension,…

Commutative Algebra · Mathematics 2007-05-23 W. Dwyer , J. P. C. Greenlees , S. Iyengar

Given a pair of number fields with isomorphic rings of adeles, we construct bijections between objects associated to the pair. For instance we construct an isomorphism of Brauer groups that commutes with restriction. We additionally…

Group Theory · Mathematics 2018-11-14 Benjamin Linowitz , D. B. McReynolds , Nicholas Miller

In this paper, using some properties of fundamental groups and covering spaces of connected polyhedra and CW-complexes, we present topological proof for some famous theorems about finitely presented groups.

Algebraic Topology · Mathematics 2010-12-09 Behrooz Mashayekhy , Hanieh Mirebrahimi

We show that every free amalgamation class of finite structures with relations and (symmetric) partial functions is a Ramsey class when enriched by a free linear ordering of vertices. This is a common strengthening of the…

Combinatorics · Mathematics 2021-07-06 David M. Evans , Jan Hubička , Jaroslav Nešetřil

This is a part of an ongoing research project, with the aim of finding the connections between properties related to theory combination in Satisfiability Modulo Theories. In previous work, 7 properties were analyzed: convexity, stable…

Logic in Computer Science · Computer Science 2024-05-03 Guilherme Vicentin de Toledo , Yoni Zohar

This paper has been withdrawn by the authors due to a crucial computational error. In this paper we deal with the finite case. We prove that a finite bounded ordered set can be represented as the order of principal congruences of a finite…

Rings and Algebras · Mathematics 2013-04-02 G. Grätzer , E. T. Schmidt

We investigate when fiber products of lattices are finitely generated and obtain a new characterization of bounded lattice homomorphisms onto lattices satisfying a property we call Dean's condition (D) which arises from Dean's solution to…

Logic · Mathematics 2021-12-02 William DeMeo , Peter Mayr , Nik Ruskuc

We present a formalization of a version of Abadi and Plotkin's logic for parametricity for a polymorphic dual intuitionistic/linear type theory with fixed points, and show, following Plotkin's suggestions, that it can be used to define a…

Logic in Computer Science · Computer Science 2017-01-11 Lars Birkedal , Rasmus E. Møgelberg , Rasmus Lerchedahl Petersen

We propose a generalization of first-order logic originating in a neglected work by C.C. Chang: a natural and generic correspondence language for any types of structures which can be recast as Set-coalgebras. We discuss axiomatization and…

Logic in Computer Science · Computer Science 2023-06-22 Tadeusz Litak , Dirk Pattinson , Katsuhiko Sano , Lutz Schröder
‹ Prev 1 8 9 10 Next ›