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)

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

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)

Cites Work

• Title not available (Why is that?)
• Elements of finite model theory.
• Machine-Independent Characterizations and Complete Problems for Deterministic Linear Time
• Invariance properties of RAMs and linear time
• Linear Time Algorithms and NP-Complete Problems
• Title not available (Why is that?)

Cited In (3)

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

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)