Dietrich Kuske und First-Order - Info zur Person

(1 - 16 von 16

)

Programm

www2.informatik.uni-stuttgart.de

Bernd Borchert, Dietrich Kuske, Frank Stephan: On Existentially First-Order Definable Languages and their Relation to NP: 17:35: Heribert Vollmer, Klaus W ...

Dietrich Kuske - ECCCeccc.weizmann.ac.il › author

eccc.weizmann.ac.il

All reports by Author Dietrich Kuske: TR | 13th February Bernd Borchert, Dietrich Kuske, Frank Stephan. On Existentially First-Order Definable ...

Dietrich Kuske & Markus Lohrey, Automatic structures of bounded...

philpapers.org

The first-order theory of a string automatic structure is known to be decidable, but there are examples of string automatic structures with nonelementary...

First-Order and Counting Theories of Ω-Automatic Structures.philpapers.org › rec › KUSFAC

philpapers.org

Dietrich Kuske & Markus Lohrey Journal of Symbolic Logic 76 (4): Some Natural Decision Problems in Automatic Graphs.

Vorlesung Ausgewählte Kapitel der Logik: Lokalitiät

www2.informatik.hu-berlin.de

Dietrich Kuske und Nicole Schweikardt, Gaifman normal forms for counting extensions of first-order logic. In Proc. ICALP LINK. Martin Grohe und Nicole Schweikardt, First-Order Query Evaluation with Cardinality Conditions. In Proc. PODS 2018, pp LINK.

[ ] First-Order Logic with Counting: At Least, Weak Hanf...

arxiv.org

Authors: Dietrich Kuske, Nicole Schweikardt. (Submitted on 3 Mar 2017). Abstract: We introduce the logic FOCN(P) which extends first-order logic by counting and by numerical predicates from a set P, and which can be viewed as a natural generalisation of various counting logics that have been studied in the literature.

First-Order and Counting Theories of ω-Automatic jstorwww.jstor.org › stable

www.jstor.org

DIETRICH KUSKE AND MARKUS LOHREY quantifiers for infinite cardinals. We show that any injectively co-automatic structure has a decidable theory in this ...

Dietrich Kuske - dblpdblp.org › Persons

dblp.org

Dietrich Kuske, Nicole Schweikardt: First-Order Logic with Counting: At Least, Weak Hanf Normal Forms Always Exist and Can Be Computed!

First-Order and Counting Theories of ω-Automatic Structures ...link.springer.com › chapter

link.springer.com

First-Order and Counting Theories of ω-Automatic Structures. Authors; Authors and affiliations. Dietrich Kuske; Markus Lohrey. Dietrich Kuske. 1. Markus Lohrey.

On Existentially First-Order Definable Languages and Their Relation...

www.cambridge.org

On Existentially First-Order Definable Languages and Their Relation to NP - Volume 33 Issue 3 - Bernd Borchert, Dietrich Kuske, Frank Stephan

Laboratoire Spécification et Vérification

www.lsv.fr

[1] Dietrich Kuske and Nicole Schweikardt. First-order logic with counting. In 32nd Annual ACM/IEEE Symposium on Logic in Computer ...

Dietrich Kuske 1. Introduction - Semantic Scholar

www.semanticscholar.org

Dietrich Kuske. 1. Abstract. It is shown that small fragments of the first-order theory of the subword order, the (partial) lexicographic path ordering on words, the homomorphism preorder, and the infix order are undecidable. This is in contrast to the decidability of the monadic second-order theory of the prefix order [M.O. Rabin ...