1995 IEEE 10th Annual Symposium on Logic in Computer Science
Dexter Kozen, IEEE Computer Society. Technical Committee on Mathematical Foundations of Computing, ACM Special Interest Group for Automata and Computability Theory
IEEE Computer Society Press, 1995 - Computers - 518 pages
What people are saying - Write a review
We haven't found any reviews in the usual places.
Once and For All
46 other sections not shown
A-calculus abstract action structure algorithm arity atomic automata automaton axioms behaviour bisimulation Boolean bound calculus causal clauses complexity class Computer Science concurrent configuration structures consider constraint construction corresponding cut elimination defined Definition denote derivation disjunctive domain E.M. Clarke edge equations equivalent event structures exists expressive extension finite first-order first-order logic formula function given graph hyperedge IEEE induction inference infinite interpretation Kripke structure labelled language Lemma linear linear logic logic programming modal model checking module morphism multiset node normal form notion obtained operational semantics operator pair paper Paramodulation path polynomial position predicate symbol probability Proc properties Proposition prove PSPACE Ptime quantifiers query recursive reduction relation result rule satisfies semantics sequence sequent calculus Springer-Verlag strategy struc subset syntactic tableau temporal logic Theorem theory tion transition transitive closure tree ture valuation variables verification problem Verilog vertex