• Aucun résultat trouvé

Transitivity and Equivalence in Decidable Fragments of First-Order Logic

N/A
N/A
Info
Télécharger
Protected

Academic year: 2022

Partager "Transitivity and Equivalence in Decidable Fragments of First-Order Logic"

Copied!
1
0
0

Chargement.... (Voir le texte intégral maintenant)

Texte intégral

(1)

Transitivity and Equivalence in Decidable Fragments of First-Order Logic

Ian Pratt-Hartmann

Department of Computer Science Manchester University Manchester M13 9PL, United Kingdom

ipratt@cs.man.ac.uk

Abstract

Of all the properties of binary relations encountered in logic, those of transitivity and equivalence are perhaps the most salient. On the other hand, it is well-known that these properties are typically not expressible in fragments of first-order logic for which the satisfiability problem is known to be decidable - most notably, the two-variable frag- ment and the guarded fragment. The question therefore arises as to what happens to familiar, decidable fragments of first-order logic under the assumption that a specified collection of binary predicates be interpreted as transitive relations or as equivalences.

This question has been the subject of intensive study in the past few years, and my talk summarizes the current state of play in this area.

Short CV. Ian Pratt-Hartmann studied Mathematics and Philosophy at Brasenose Col- lege, Oxford, and Philosophy at Princeton and Stanford Universities, gaining his PhD.

from Princeton in 1987. He is currently Senior Lecturer in the Department of Com- puter Science at the University of Manchester. Dr. Pratt-Hartmann’s research interests range widely over the fields of computational logic, spatial logic and natural language semantics.

Références

Télécharger maintenant ( PDF - 1 Page - 38.19 KB )

Documents relatifs

Foundational proof certificates in first-order logic

The augmentations to the LKF inference rules is done in three simple steps: (i) a proof certificate term, denoted by the syntactic variable Ξ is added to every sequent; (ii)

Finite-Degree Predicates and Two-Variable First-Order Logic

We first prove that languages with a neutral letter definable in two- variable logic with arbitrary numerical predicates can be defined allowing only the linear order and the

A proof of completeness for continuous first-order logic

Continuous first-order logic was developed in [BU] as an extension of classical first- order logic, permitting one to broaden the aforementioned classical analysis of algebraic

Fragments of First-Order Logic over Infinite Words (Extended Abstract)

Together with the PSPACE-completeness of the problem whether a language is closed in the alphabetic topology (Thm. 3.4), this yields decidability of the membership problem for

The Limits of Decidability for First Order Logic on CPDA Graphs

[7] showed that the model-checking problem for MSO on 2-CPDA graphs is undecidable; indeed the 2-CPDA graph they exhibit witnesses the undecidability of transitive closure logic

Extensions of sampling-based approaches to path planning in complex cost spaces: applications to robotics and structural biology

Nous ´evaluons T-RRT* et AT-RRT sur plusieurs probl`emes de planification de chemin optimal, et nous montrons qu’ils convergent vers le chemin optimal plus rapidement que RRT*.

Order-Invariant First-Order Logic over Hollow Trees

In order to show that <-inv FO collapses to FO over a class of structures of bounded treewidth, it is tempting to reduce the case of bounded treewidth to the case of trees,

Simple proof of the completeness theorem for second order classical and intuitionictic logic by reduction to first-order mono-sorted logic

Simple proof of the completeness theorem for second order classical and intuitionictic logic by reduction to first-order mono-sorted logic... Simple proof of the completeness