Universal Horn Sentences and the Joint Embedding Property

04/22/2021 ∙ by Manuel Bodirsky, et al. ∙ 0

The finite models of a universal sentence Φ are the age of a structure if and only if Φ has the joint embedding property. We prove that the computational problem whether a given universal sentence Φ has the joint embedding property is undecidable, even if Φ is additionally Horn and the signature is binary.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.