Definability in structures of finite valency

I. Korec; M. Peretiatkin; W. Rautenberg

Displaying similar documents to “Definability in structures of finite valency”

Refinement properties for relational structures

C. Chang, B. Jónsson, Alfred Tarski (1964)

Fundamenta Mathematicae

Similarity:

Transitive closures of binary relations. I.

Václav Flaška, Jaroslav Ježek, Tomáš Kepka, Juha Kortelainen (2007)

Acta Universitatis Carolinae. Mathematica et Physica

Similarity:

Basic Operations on Preordered Coherent Spaces

Klaus Grue, Artur Korniłowicz (2007)

Formalized Mathematics

Similarity:

This Mizar paper presents the definition of a "Preordered Coherent Space" (PCS). Furthermore, the paper defines a number of operations on PCS's and states and proves a number of elementary lemmas about these operations. PCS's have many useful properties which could qualify them for mathematical study in their own right. PCS's were invented, however, to construct Scott domains, to solve domain equations, and to construct models of various versions of lambda calculus.For more on PCS's,...