arXiv Open Access 2004

FPL may be equivalent to FO but not equivalent to PFP

Saharon Shelah

Lihat Sumber

Abstrak

Given a class of finite models we would like to expand each model (allowing new elements but the old universe is a separate sort), making the expressive power of LFP (least fix point logic) and PFP (inductive logic) similar while not changing the expressive power of FO (first order logic). This continues in math.LO/9411235.

Topik & Kata Kunci

math.LO

Penulis (1)

Saharon Shelah

Format Sitasi

APA MLA BibTeX

Shelah, S. (2004). FPL may be equivalent to FO but not equivalent to PFP. https://arxiv.org/abs/math/0404205

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2004
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓