The first part of this book concerns the present state of the theory of chains (= total or linear orderings), in connection with some refinements of Ramsey's theorem, due to Galvin and Nash-Williams. This leads to the fundamental Laver's embeddability theorem for scattered chains, using Nash-Williams' better quasi-orderings, barriers and forerunning.The second part (chapters 9 to 12) extends to general relations the main notions and results from order-type theory. An important connection appears with permutation theory (Cameron, Pouzet, Livingstone and Wagner) and with logics (existence crite
We propose inference systems based on ordered chaining and a concept of (global) redundancy for clau...
We propose inference systems based on ordered chaining and a concept of (global) redundancy for clau...
"Ordered sets are ubiquitous in mathematics and have significant applications in computer science, s...
This chapter introduces the most basic constructs of order theory. In the decreasing order of genera...
We propose inference systems for binary relations with composition laws of the form $S\circ T\subset...
A set of six axioms for sets of relations is introduced. All well-known sets of specific orderings, ...
A partially ordered set (poset) is a pair (S,R) where S is a nonempty set and R is a reflexive, ant...
A proof-theoretical analysis of elementary theories of order relations is effected through the formu...
In this paper we begin with the basics of multisets and their operations introduced in[5, 22]and def...
In this chapter, we present a mathematical topic, the theory of relations. The concepts and techniqu...
The purpose of this paper is to present a study of partly ordered sets. It includes a rigorous devel...
The second edition of this highly praised textbook provides an expanded introduction to the theory o...
We introduce two Ramsey classes of finite relational structures. The first class contains finite str...
Lattice Theory presents an elementary account of a significant branch of contemporary mathematics co...
We construct a monadic second-order sentence that characterizes the ternary relations that are the b...
We propose inference systems based on ordered chaining and a concept of (global) redundancy for clau...
We propose inference systems based on ordered chaining and a concept of (global) redundancy for clau...
"Ordered sets are ubiquitous in mathematics and have significant applications in computer science, s...
This chapter introduces the most basic constructs of order theory. In the decreasing order of genera...
We propose inference systems for binary relations with composition laws of the form $S\circ T\subset...
A set of six axioms for sets of relations is introduced. All well-known sets of specific orderings, ...
A partially ordered set (poset) is a pair (S,R) where S is a nonempty set and R is a reflexive, ant...
A proof-theoretical analysis of elementary theories of order relations is effected through the formu...
In this paper we begin with the basics of multisets and their operations introduced in[5, 22]and def...
In this chapter, we present a mathematical topic, the theory of relations. The concepts and techniqu...
The purpose of this paper is to present a study of partly ordered sets. It includes a rigorous devel...
The second edition of this highly praised textbook provides an expanded introduction to the theory o...
We introduce two Ramsey classes of finite relational structures. The first class contains finite str...
Lattice Theory presents an elementary account of a significant branch of contemporary mathematics co...
We construct a monadic second-order sentence that characterizes the ternary relations that are the b...
We propose inference systems based on ordered chaining and a concept of (global) redundancy for clau...
We propose inference systems based on ordered chaining and a concept of (global) redundancy for clau...
"Ordered sets are ubiquitous in mathematics and have significant applications in computer science, s...