A NORMAL FORM FOR FIRST-ORDER LOGIC OVER DOUBLY-LINKED DATA STRUCTURES

DOI10.1142/S0129054108005632zbMATH Open1161.68401MaRDI QIDQ3532152FDOQ3532152

Authors Steven Lindell

Publication date 3 November 2008

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

linear time model checkinglogical normal forms

Mathematics Subject Classification ID

Data structures (68P05) Specification and verification (program logics, model checking, etc.) (68Q60) Classical first-order logic (03B10)

Recommendations

• A logic of reachable patterns in linked data-structures
• Computing thejth solution of a first-order query
• Computing with first-order logic
• scientific article; zbMATH DE number 1136084
• First order data types and first order logic

Cites work

• scientific article; zbMATH DE number 3122413 (Why is no real title available?)
• scientific article; zbMATH DE number 3743230 (Why is no real title available?)
• Elements of finite model theory.
• Invariance properties of RAMs and linear time
• Linear Time Algorithms and NP-Complete Problems
• Machine-Independent Characterizations and Complete Problems for Deterministic Linear Time

Cited in

(3)

• Computing thejth solution of a first-order query
• An optimal construction of Hanf sentences
• A logical approach to locality in pictures languages

This page was built for publication: A NORMAL FORM FOR FIRST-ORDER LOGIC OVER DOUBLY-LINKED DATA STRUCTURES

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