Show simple item record

dc.contributor.authorKfoury, A.J.
dc.contributor.authorWymann-Böni, M.
dc.date.accessioned2011-09-12T14:25:46Z
dc.date.available2011-09-12T14:25:46Z
dc.date.issued1993-08-11
dc.identifier.citationKfoury, A.J.; Wymann-Boeni, M.. "Fixed Point vs. First-Order Logic on Finite Ordered Structures with Unary Relations", Technical Report BUCS-1993-008, Computer Science Department, Boston University, June 1993. [Available from: http://hdl.handle.net/2144/1471]en_US
dc.identifier.urihttp://hdl.handle.net/2144/1471
dc.description.abstractWe prove that first order logic is strictly weaker than fixed point logic over every infinite classes of finite ordered structures with unary relations: Over these classes there is always an inductive unary relation which cannot be defined by a first-order formula, even when every inductive sentence (i.e., closed formula) can be expressed in first-order over this particular class. Our proof first establishes a property valid for every unary relation definable by first-order logic over these classes which is peculiar to classes of ordered structures with unary relations. In a second step we show that this property itself can be expressed in fixed point logic and can be used to construct a non-elementary unary relation.en_US
dc.description.sponsorshipNSF (CCR-9113196), Swiss National Science Foundationen_US
dc.language.isoen_USen_US
dc.publisherBoston University Computer Science Departmenten_US
dc.relation.ispartofseriesBUCS Technical Reports;BUCS-TR-1993-008
dc.titleFixed Point vs. First-Order Logic on Finite Ordered Structures with Unary Relationsen_US
dc.typeTechnical Reporten_US


Files in this item

This item appears in the following Collection(s)

Show simple item record