A Representation Theorem for Stratified Complete Lattices

被引：0
作者：
Esik, Zoltan [1 ]
机构：
[1] Univ Szeged, Dept Comp Sci, Szeged, Hungary
来源：
LOGIC, LANGUAGE, AND COMPUTATION (TBILLC 2015) | 2017年 / 10148卷
关键词：
SEMANTICS;
D O I：
10.1007/978-3-662-54332-0-15
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
Stratified complete lattices are complete lattices equipped with a sequence of preorderings associated with the ordinals less than a given nonzero ordinal, typically a limit ordinal. They have been used to give semantics to recursive definitions involving nonmonotonic operations. We provide representation theorems for stratified complete lattices by inverse limits of complete lattices.
引用
收藏
页码：263 / 289
页数：27
相关论文
共 11 条
  • [1] [Anonymous], 2002, INTRODUCTION, DOI DOI 10.1017/CBO9780511809088
  • [2] Minimum Model Semantics for Extensional Higher-order Logic Programming with Negation
    Charalambidis, Angelos
    Esik, Zoltan
    Rondogiannis, Panos
    [J]. THEORY AND PRACTICE OF LOGIC PROGRAMMING, 2014, 14 : 725 - 737
  • [3] Denecker M, 2000, SPRINGER INT SER ENG, V597, P127
  • [4] Esik Zoltan, 2014, Logic, Language, Information, and Computation. 21st International Workshop, WoLLIC 2014. Proceedings: LNCS 8652, P166, DOI 10.1007/978-3-662-44145-9_12
  • [5] Esik Z, 2015, ARXIV150305124
  • [6] Equational Properties of Stratified Least Fixed Points (Extended Abstract)
    Esik, Zoltan
    [J]. LOGIC, LANGUAGE, INFORMATION, AND COMPUTATION, WOLLIC 2015, 2015, 9160 : 174 - 188
  • [7] A fixed point theorem for non-monotonic functions
    Esik, Zoltan
    Rondogiannis, Panos
    [J]. THEORETICAL COMPUTER SCIENCE, 2015, 574 : 18 - 38
  • [8] Fixpoint semantics for logic programming a survey
    Fitting, M
    [J]. THEORETICAL COMPUTER SCIENCE, 2002, 278 (1-2) : 25 - 51
  • [9] Gierz G., 2003, Continuous Lattices and Domains
  • [10] Rondogiannis R., 2005, ACM T COMPUT LOG, V6, P441
12