An observational subset of first-order logic cannot specify the behaviour of a counter. (Extended abstract)

DOI10.1007/BFB0020824MaRDI QIDQ4035696zbMATH OpenFDO

Authors Oliver Schoett

Publication date 18 May 1993

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0020824

zbMATH Keywords

specification language for abstract data types

Mathematics Subject Classification ID

Logic in computer science (03B70) Abstract data types; algebraic specification (68Q65)

Recommendations

• The subtrace order and counting first-order logic
• On the undecidability of some sub-classical first-order logics
• Counterexamples of the 0-1 Law for Fragments of Existential Second-Order Logic: an Overview
• First-order logic and its infinitary quantifier extensions over countable words
• The non-definability notion and first order logic
• On the undecidability of logics with converse, nominals, recursion and counting
• scientific article; zbMATH DE number 408805
• Decidable first-order modal logics with counting quantifiers
• A theory of observables for logic programs
• A nonmonotonic observation logic

Cited in

(2)

• Two impossibility theorems on behaviour specification of abstract data types
• Toward formal development of programs from algebraic specifications: model-theoretic foundations

This page was built for publication: An observational subset of first-order logic cannot specify the behaviour of a counter. (Extended abstract)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4035696)