✦ LIBER ✦

Program schemata and the first-order decision problem

✍ Scribed by Harry R. Lewis

Publisher: Elsevier Science
Year: 1974
Tongue: English
Weight: 594 KB
Volume: 8
Category: Article
ISSN: 0022-0000
DOI: 10.1016/s0022-0000(74)80023-1

No coin nor oath required. For personal study only.

✦ Synopsis

In [7] Manna reduces certain decision problems for program schemata to the problem of determining whether or not a first-order formula is satisfiable. Here we give an improved construction, which yields new positive results and suggests a method that may be useful in further investigations.

📜 SIMILAR VOLUMES

Turing machines with linear alternation,

Turing machines with linear alternation, theories of bounded concatenation and the decision problem of first order theories

✍ Hugo Volger 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 467 KB

Relaxations of linear programming proble

Relaxations of linear programming problems with first order stochastic dominance constraints

✍ Nilay Noyan; Gábor Rudolf; Andrzej Ruszczyński 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 177 KB

The Decision Problem for a Class of Firs

The Decision Problem for a Class of First-Order Formulas in Which all Disjunctions are Binary

✍ M. R. Krom 📂 Article 📅 1967 🏛 John Wiley and Sons 🌐 English ⚖ 468 KB 👁 1 views

Loop-separable programs and their first-

Loop-separable programs and their first-order definability

✍ Yin Chen; Fangzhen Lin; Yan Zhang; Yi Zhou 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 399 KB

Asymptotic behavior of the first order o

Asymptotic behavior of the first order obstacle problem

✍ I.Capuzzo Dolcetta; J.L Menaldi 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 947 KB

First-order linear PDEs and uniqueness i

First-order linear PDEs and uniqueness in the Cauchy problem

✍ Monty Strauss; François Treves 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 677 KB