2002
DOI: 10.1017/cbo9780511809088
|View full text |Cite
|
Sign up to set email alerts
|

Introduction to Lattices and Order

Abstract: This new edition of Introduction to Lattices and Order presents a radical reorganization and updating, though its primary aim is unchanged. The explosive development of theoretical computer science in recent years has, in particular, influenced the book's evolution: a fresh treatment of fixpoints testifies to this and Galois connections now feature prominently. An early presentation of concept analysis gives both a concrete foundation for the subsequent theory of complete lattices and a glimpse of a methodolog… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

2
1,308
0
21

Year Published

2006
2006
2016
2016

Publication Types

Select...
4
3
2

Relationship

0
9

Authors

Journals

citations
Cited by 2,652 publications
(1,331 citation statements)
references
References 0 publications
2
1,308
0
21
Order By: Relevance
“…Assumption 4 is not satis…ed for general concave production in private inputs (with no externalities). Further, in the case of production externalities as in Romer [50] we could have F (k; 1; K; 1) = k K for < 0; 2 (0; 1); and j j > , which also violates Assumption 4: 16 There are no shocks.…”
Section: The Economiesmentioning
confidence: 97%
See 1 more Smart Citation
“…Assumption 4 is not satis…ed for general concave production in private inputs (with no externalities). Further, in the case of production externalities as in Romer [50] we could have F (k; 1; K; 1) = k K for < 0; 2 (0; 1); and j j > , which also violates Assumption 4: 16 There are no shocks.…”
Section: The Economiesmentioning
confidence: 97%
“…Thus g^is an greatest lower bound of B. Since m is the top element of H u m , it is a complete lattice (e.g., Davey and Priestley [16], Theorem 2.31). Dually, for A H l m ; de…ne g _ (k) = sup h2A h(k).…”
Section: Re In Olg Modelsmentioning
confidence: 99%
“…We employ basic notions from partial order theory [12]. A partial order is a set P with a partial order relation "≤" and it is denoted by (P, ≤).…”
Section: Basic Notions and Definitionsmentioning
confidence: 99%
“…The proposition s, which gures as a disjunct in a's account, is eliminated from the node bc onwards. 3 Formulae computed using The Logics Workbench, http://www.lwb.unibe.ch/.…”
Section: Theoremmentioning
confidence: 99%