ϵ">]>
Literature.
[1] J. Komara and P. J. Voda. Metamathematics of Computer Programming. 2001.
[2] J. Kľuka. Lecture Notes from Introduction to Declarative Programming Summer 2010/11.
[CL] Syntax. Examples:
Atomic formulas: , .
Propositional connectives: , , , , , , .
Bounded quantification: , , , .
Notational conventions: , , , , .
Remark. Bounded quantifiers have greater precedence than propositional connectives. For instance, following formulas are different