Computation theory and logic
Proceedings of the 30th IEEE symposium on Foundations of computer science
An axiomatic basis for computer programming
Communications of the ACM
The underlying logic of hoare logic
Current trends in theoretical computer science
Universality of data retrieval languages
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
The complexity of relational query languages (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Relational queries computable in polynomial time (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Existential Positive Types and Preservation under Homomorphisisms
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Elementary induction on abstract structures (Studies in logic and the foundations of mathematics)
Elementary induction on abstract structures (Studies in logic and the foundations of mathematics)
DKAL: Distributed-Knowledge Authorization Language
CSF '08 Proceedings of the 2008 21st IEEE Computer Security Foundations Symposium
Yuri, logic, and computer science
Fields of logic and computation
Datalog: a perspective and the potential
Datalog 2.0'12 Proceedings of the Second international conference on Datalog in Academia and Industry
| Hi-index | 0.00 |
Existential fixed point logic (EFPL) is a natural fit for some applications, and the purpose of this talk is to attract attention to EFPL. The logic is also interesting in its own right as it has attractive properties. One of those properties is rather unusual: truth of formulas can be defined (given appropriate syntactic apparatus) in the logic. We mentioned that property elsewhere, and we use this opportunity to provide the proof.