First-order dynamic logic

What do you do to start reading first order dynamic logic? Searching the book that you love to read first or find an interesting book that will make you want to read? Everybody has difference with their reason of reading a book. Actuary, reading habit must be from earlier. Many people may be love to read, but not a book. It's not fault. Someone will be bored to open the thick book with small words to read. In more, this is the real condition. So do happen probably with this first order dynamic logic.

[1]  Vaughan R. Pratt,et al.  Dynamic algebras and the nature of induction , 1980, STOC '80.

[2]  George Boole,et al.  The mathematical analysis of logic , 1948 .

[3]  Vera Trnková,et al.  Dynamic Algebras which are not Kripke Structures , 1980, MFCS.

[4]  Vaughan R. Pratt,et al.  A decidable mu-calculus: Preliminary report , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[5]  Arto Salomaa.  Jewels of formal language theory , 1981 .

[6]  G. B. M..  Principia Mathematica , 1911, Nature.

[7]  Y. Moschovakis.  Descriptive Set Theory , 1980 .

[8]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[9]  Richard E. Ladner,et al.  Propositional Dynamic Logic of Regular Programs , 1979, J. Comput. Syst. Sci..

[10]  Joseph Y. Halpern.  On the Expressive Power of Dynamic Logic. II , 1981 .

[11]  Vaughan R. Pratt,et al.  A Near-Optimal Method for Reasoning about Action , 1980, J. Comput. Syst. Sci..

[12]  David C. Luckham,et al.  On Formalised Computer Programs , 1970, J. Comput. Syst. Sci..

[13]  Krzysztof R. Apt,et al.  Ten Years of Hoare's Logic: A Survey—Part I , 1981, TOPL.

[14]  Dexter Kozen,et al.  A Representation Theorem for Models of *-Free PDL , 1980, ICALP.

[15]  Patrick Suppes,et al.  Naive Set Theory , 1961 .

[16]  Roland Carl Backhouse.  Closure algorithms and the star-height problem of regular languages , 1976 .

[17]  George Gratzer,et al.  Universal Algebra , 1979 .

[18]  Lyle Harold Ramshaw,et al.  Formalizing the analysis of algorithms , 1979 .

[19]  Dexter Kozen,et al.  On the Duality of Dynamic Algebras and Kripke Models , 1979, Logic of Programs.

[20]  Jerzy Tiuryn,et al.  A Note On Equivalences Among Logics of Programs , 1981, Logic of Programs.

[21]  David S. Johnson,et al.  Computers and Inrracrobiliry: A Guide ro the Theory of NP-Completeness , 1979 .

[22]  Sergei Ivanovich Adian,et al.  The Burnside problem and identities in groups , 1979 .

[23]  N. Dunford,et al.  On the Representation Theorem for Boolean Algebras , 1944 .

[24]  Zohar Manna,et al.  Logics of Programs , 1981, Lecture Notes in Computer Science.

[25]  Vaughan R. Pratt,et al.  Using Graphs to Understand PDL , 1981, Logic of Programs.

[26]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[27]  Jerzy Tiuryn.  A Survey of the Logic of Effective Definitions , 1979, Logic of Programs.

[28]  G. E. Hughes,et al.  An introduction to modal logic, 2e éd., 1 vol , 1973 .

[29]  J. Conway.  Regular algebra and finite machines , 1971 .

[30]  S C Kleene,et al.  Representation of Events in Nerve Nets and Finite Automata , 1951 .

[31]  Leon Henkin,et al.  The completeness of the first-order functional calculus , 1949, Journal of Symbolic Logic.

[32]  Joseph R. Shoenfield,et al.  Mathematical logic , 1967 .

[33]  Emil L. Post.  Recursively enumerable sets of positive integers and their decision problems , 1944 .

[34]  Edmund M. Clarke,et al.  Programming Language Constructs for Which It Is Impossible To Obtain Good Hoare Axiom Systems , 1979, JACM.

[35]  Robert S. Streett.  Propositional Dynamic Logic of looping and converse , 1981, STOC '81.

[36]  Grazyna Mirkowska,et al.  Algorithmic logic with nondeterministic programs , 1980, Fundam. Informaticae.

[37]  Rohit Parikh.  Propositional Dynamic Logics of Programs: a Survey , 1979, Logic of Programs.

[38]  Patrick C. Fischer,et al.  Turing Machines with Restricted Memory Access , 1966, Inf. Control..

[39]  A. Salwicki.  Algorithmic Logic, a Tool for Investigations of Programs , 1977 .

[40]  Vaughan R. Pratt,et al.  SEMANTICAL CONSIDERATIONS ON FLOYD-HOARE LOGIC , 1976, FOCS 1976.

[41]  Vladimir Yu. Sazonov.  Polynomial Computability and Recursivity in Finite Domains , 1980, J. Inf. Process. Cybern..

[42]  Harvey M. Friedman,et al.  Algorithmic Procedures, Generalized Turing Algorithms, and Elementary Recursion Theory , 1971 .

[43]  Albert R. Meyer,et al.  The Deducibility Problem in Propositional Dynamic Logic , 1979, Logic of Programs.

[44]  H. Keisler.  Model theory for infinitary logic , 1971 .

[45]  Yiannis N. Moschovakis,et al.  Elementary induction on abstract structures , 1974 .

[46]  Jr. Hartley Rogers.  Theory of Recursive Functions and Effective Computability , 1969 .

[47]  David Harel,et al.  First-Order Dynamic Logic , 1979, Lecture Notes in Computer Science.

[48]  Sheila A. Greibach,et al.  Theory of Program Structures: Schemes, Semantics, Verification , 1976, Lecture Notes in Computer Science.

[49]  Rohit Parikh,et al.  The Completeness of Propositional Dynamic Logic , 1978, MFCS.

[50]  A. Turing.  On Computable Numbers, with an Application to the Entscheidungsproblem. , 1937 .

[51]  Richard J. Lipton,et al.  A necessary and sufficient condition for the existence of hoare logics , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[52]  Rohit Parikh.  A decidability result for a second order process logic , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).

[53]  Johan Anthory Willem Kamp,et al.  Tense logic and the theory of linear order , 1968 .

[54]  C. A. R. HOARE,et al.  An axiomatic basis for computer programming , 1969, CACM.

[55]  Mars K. Valiev.  Decision Complexity of Variants of Propositional Dynamic Logic , 1980, MFCS.

[56]  Saharon Shelah,et al.  On the temporal analysis of fairness , 1980, POPL '80.

[57]  István Németi,et al.  Nonstandard Dynamic Logic , 1981, Logic of Programs.

[58]  Albert R. Meyer,et al.  Computability and completeness in logics of programs (Preliminary Report) , 1977, STOC '77.

[59]  A. Ehrenfeucht.  An application of games to the completeness problem for formalized theories , 1961 .

[60]  H. Rice.  Classes of recursively enumerable sets and their decision problems , 1953 .

[61]  Gary L. Miller.  Riemann's Hypothesis and Tests for Primality , 1976, J. Comput. Syst. Sci..

[62]  M. Minsky.  Recursive Unsolvability of Post's Problem of "Tag" and other Topics in Theory of Turing Machines , 1961 .

[63]  S. Kleene.  Recursive predicates and quantifiers , 1943 .

[64]  Robert E. Tarjan,et al.  A Unified Approach to Path Problems , 1981, JACM.

[65]  Karl R. Abrahamson.  Decidability and expressiveness of logics of processes , 1980 .

[66]  Rod M. Burstall,et al.  Program Proving as Hand Simulation with a Little Induction , 1974, IFIP Congress.

[67]  Robert L. Constable,et al.  On the theory of programming logics , 1977, STOC '77.

[68]  Joseph Y. Halpern,et al.  The Propositional Dynamic Logic of Deterministic, Well-Structured Programs (Extended Abstract) , 1981, FOCS.

[69]  Alfred Tarski,et al.  Der Wahrheitsbegriff in den formalisierten Sprachen , 1935 .

[70]  Dana S. Scott,et al.  Finite Automata and Their Decision Problems , 1959, IBM J. Res. Dev..

[71]  Vaughan R. Pratt.  A practical decision method for propositional dynamic logic (Preliminary Report) , 1978, STOC '78.

[72]  H. Gordon Rice,et al.  On completely recursively enumerable classes and their key arrays , 1956, Journal of Symbolic Logic.

[73]  G. Birkhoff,et al.  On the Structure of Abstract Algebras , 1935 .

[74]  J. W. de Bakker,et al.  Mathematical theory of program correctness , 1980, Prentice-Hall international series in computer science.

[75]  Vaughan R. Pratt,et al.  Models of program logics , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[76]  Zohar Manna,et al.  Verification of Concurrent Programs: Temporal Proof Principles , 1981, Logic of Programs.

[77]  Robert E. Noonan.  Dynamic algebra , 1974, ACM '74.

[78]  S. Kleene.  On the Forms of the Predicates in the Theory of Constructive Ordinals (Second Paper) , 1955 .

[79]  David Harel,et al.  Nondeterminism in logics of programs , 1978, POPL.

[80]  David Harel,et al.  Process Logic: Expressiveness, Decidability, Completeness , 1980, FOCS.

[81]  Stephen A. Cook,et al.  Soundness and Completeness of an Axiom System for Program Verification , 1978, SIAM J. Comput..

[82]  K. Gödel.  Die Vollständigkeit der Axiome des logischen Funktionenkalküls , 1930 .

[83]  Emil L. Post.  Formal Reductions of the General Combinatorial Decision Problem , 1943 .

[84]  Francine Berman,et al.  Propositional Dynamic Logic is Weaker without Tests , 1981, Theor. Comput. Sci..

[85]  Richard E. Ladner,et al.  Propositional modal logic of programs , 1977, STOC '77.

[86]  Johann A. Makowsky.  Measuring the Expressive Power of Dynamic Logics: An Application of Abstract Model Theory , 1980, ICALP.

[87]  M. Rabin.  Probabilistic algorithm for testing primality , 1980 .

[88]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[89]  Brian F. Chellas.  Modal Logic: Normal systems of modal logic , 1980 .

[90]  Arto Salomaa,et al.  Two Complete Axiom Systems for the Algebra of Regular Events , 1966, JACM.

[91]  Francine Berman.  A completeness technique for d-axiomatizable semantics , 1979, STOC '79.

[92]  Dexter Kozen,et al.  On Induction vs. *-Continuity , 1981, Logic of Programs.

[93]  Grazyna Mirkowska,et al.  PAL - propositional algorithmic logic , 1979, Fundam. Informaticae.

[94]  David Gries,et al.  The Science of Programming , 1981, Text and Monographs in Computer Science.

[95]  J. Hartmanis,et al.  On the Computational Complexity of Algorithms , 1965 .

[96]  Carl Hewitt,et al.  Comparative Schematology , 1970 .

[97]  Albert R. Meyer,et al.  Definability in Dynamic Logic , 1980, STOC '80.