Definition of flat poset and existence theorems for recursive call

DOI10.2478/FORMA-2014-0001zbMath1298.06001OpenAlexW2101628240MaRDI QIDQ467805

Kazuhisa Ishida, Adam Grabowski, Yasunari Shidama

Publication date: 5 November 2014

Published in: Formalized Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2478/forma-2014-0001

zbMATH Keywords

flat posetsflattening operatorrecursive calls for posets

Mathematics Subject Classification ID

Theory of programming languages (68N15) Semantics in the theory of computing (68Q55) Mechanization of proofs and logical operations (03B35) Algebraic aspects of posets (06A11)

Uses Software

• Mizar

Cites Work

• Semantics of MML Query - Ordering
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Definition of flat poset and existence theorems for recursive call