Stability of weak second-order semantics
From MaRDI portal
Publication:1825629
DOI10.1007/BF00370550zbMath0684.68029OpenAlexW2155605013MaRDI QIDQ1825629
Publication date: 1989
Published in: Studia Logica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00370550
Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60)
Cites Work
- Unnamed Item
- A simple proof for the completeness of Floyd's method
- A survey of basic stability theory, with particular emphasis on orthogonality and regular types
- A complete logic for reasoning about programs via nonstandard model theory. I
- Classification theory and the number of non-isomorphic models
- Strong Semantical Characterization for Nondeterministic Programs
This page was built for publication: Stability of weak second-order semantics