Finiteness is mu-ineffable

DOI10.1016/0304-3975(76)90022-0zbMath0353.02027OpenAlexW1979159285MaRDI QIDQ1236111

David Park

Publication date: 1977

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: http://wrap.warwick.ac.uk/46301/7/WRAP_Park_cs-rr-003.pdf

Mathematics Subject Classification ID

Classical first-order logic (03B10) General topics in the theory of software (68N01) Computability and recursion theory (03D99) Algorithms in computer science (68W99)

Related Items (17)

Stratified least fixpoint logic ⋮ Concurrent program schemes and their logics ⋮ BDD-Based Symbolic Model Checking ⋮ Combining Model Checking and Deduction ⋮ The mu-calculus and Model Checking ⋮ Propositional dynamic logic with recursive programs ⋮ An automata theoretic decision procedure for the propositional mu- calculus ⋮ A functional programming approach to the specification and verification of concurrent systems ⋮ Definability in dynamic logic ⋮ Inf-datalog, Modal Logic and Complexities ⋮ From Philosophical to Industrial Logics ⋮ From Monadic Logic to PSL ⋮ Interfaces between languages for communicating systems ⋮ On some classes of interpretations ⋮ On global induction mechanisms in aμ-calculus with explicit approximations ⋮ Integrating induction and coinduction via closure operators and proof cycles ⋮ Equivalences among logics of programs

Cites Work

• On formalised computer programs
• Model theory for infinitary logic. Logic with countable conjunctions and finite quantifiers
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Finiteness is mu-ineffable