Fluted formulas and the limits of decidability

DOI10.2307/2275678zbMATH Open0858.03012OpenAlexW2044898496MaRDI QIDQ4894729FDOQ4894729

Authors: William C. Purdy 

Publication date: 19 March 1997

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://surface.syr.edu/eecs_techreports/154

Recommendations

• Decidability of fluted logic with identity
• scientific article; zbMATH DE number 1696781
• scientific article; zbMATH DE number 1696834
• scientific article; zbMATH DE number 3855058
• scientific article; zbMATH DE number 1916517
• From formulas to cirquents in computability logic
• scientific article
• scientific article; zbMATH DE number 1670476
• scientific article; zbMATH DE number 4116512
• scientific article; zbMATH DE number 3995646

zbMATH Keywords

decidabilitysatisfiabilityfluted formula

Mathematics Subject Classification ID

Classical first-order logic (03B10) Decidability of theories and sets of sentences (03B25)

Cites Work

• Predicate-functors and the limits of decidability in logic
• Title not available (Why is that?)
• A logic for natural language

Cited In (6)

• Decidability of fluted logic with identity
• Axiomatizing the monodic fragment of first-order temporal logic
• THE FLUTED FRAGMENT REVISITED
• The fluted fragment with transitive relations
• Craig interpolation for decidable first-order fragments
• The Fluted Fragment with Transitivity

Uses Software

• ETPS

This page was built for publication: Fluted formulas and the limits of decidability

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