Alternation Is Strict For Higher-Order Modal Fixpoint Logic

Article Properties
Cite
Bruse, Florian. “Alternation Is Strict For Higher-Order Modal Fixpoint Logic”. Electronic Proceedings in Theoretical Computer Science, vol. 226, 2016, pp. 105-19, https://doi.org/10.4204/eptcs.226.8.
Bruse, F. (2016). Alternation Is Strict For Higher-Order Modal Fixpoint Logic. Electronic Proceedings in Theoretical Computer Science, 226, 105-119. https://doi.org/10.4204/eptcs.226.8
Bruse F. Alternation Is Strict For Higher-Order Modal Fixpoint Logic. Electronic Proceedings in Theoretical Computer Science. 2016;226:105-19.
Journal Category
Science
Mathematics
Instruments and machines
Electronic computers
Computer science
Refrences
Title Journal Journal Categories Citations Publication Date
A Type-Directed Negation Elimination 2015
Alternating Parity Krivine Automata 2014
A call-by-name lambda-calculus machine Higher-Order and Symbolic Computation 49 2007
The alternation hierarchy in fixpoint logic with chop is strict too Information and Computation
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
  • Technology: Technology (General): Industrial engineering. Management engineering: Applied mathematics. Quantitative methods
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science: Computer software
  • Technology: Electrical engineering. Electronics. Nuclear engineering: Electronics: Computer engineering. Computer hardware
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
 1 2006
A Higher Order Modal Fixed Point Logic 2004