Default Theories Over Monadic Languages | Zendy

Michael Kaminski | Zendy; Julia Mosin | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Default Theories Over Monadic Languages

Author(s) -

Michael Kaminski,

Julia Mosin

Publication year - 2005

Publication title -

electronic notes in theoretical computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.242

H-Index - 60

ISSN - 1571-0661

DOI - 10.1016/j.entcs.2004.04.045

Subject(s) - decidability , cardinality (data modeling) , closure (psychology) , domain (mathematical analysis) , mathematics , computer science , variable (mathematics) , discrete mathematics , mathematical analysis , economics , market economy , data mining

In this paper we compare the semantical and syntactical definitions of extensions for open default theories. We prove that, over monadic languages, these definitions are equivalent and do not depend on the cardinality of the underlying infinite world. We also show that, under the domain closure assumption, one free variable open default theories are decidable

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research