Add to ORKG85 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2002.Given an (undecidable) elementary theory of a computability-theoretic structure, it is natural to ask how much of the theory is decidable. An AE-sentence is a sentence in prenex normal form with all universal quantifiers preceding all existential quantifiers, and the AE-theory of a structure is the set of all AE-sentences true in the structure. In Chapter 3 we show that the AE-theory of ( LP01 , ∩, ∪, 0, 1) is decidable. In Chapter 4 we show that the AE-theories of ( LP01 , ∩, ∪, 0, 1) and ( LP01 * , ∩, ∪, 0, 1) are different and provide a decision procedure for the AE-theory of ( LP01 * , ∩, ∪, 0, 1).U of I OnlyRestricted to the U of...
We consider positive rules in which the conclusion may contain existentially quantified variables, w...
The topic of this thesis is the extraction of efficient and readable programs from formal constructi...
In this paper we show that the usual intuitionistic characterization of the decidability of the prop...
A general mechanism to extend decision algorithms to deal with additional predicates is described. T...
The problem is addressed of establishing the satisfiability of prenex formulas involving a single un...
We survey two series of results concerning the decidability of fragments of Tarksi's elementary alge...
Suppose we are given a mathematical theory. Is there an effective procedure which will enable us to ...
In the context of combinations of theories with disjoint signatures, we classify the component theor...
In the context of combinations of theories with disjoint signatures, we classify the component theor...
This paper surveys various decidability results in the set theory. In the first part, we focus on ce...
In the context of combinations of theories with disjoint signatures, we classify the component theor...
We consider positive rules in which the conclusion may contain existentially quantified variables, w...
The aim of these lectures is to give a clear and explicit overview of the most important decidable a...
The hierarchic superposition calculus over a theory T, called SUP(T), enables sound reasoning on the...
Abstract. This paper treats decision problexs for the intuitionistic logic without weak-ening rule F...
We consider positive rules in which the conclusion may contain existentially quantified variables, w...
The topic of this thesis is the extraction of efficient and readable programs from formal constructi...
In this paper we show that the usual intuitionistic characterization of the decidability of the prop...
A general mechanism to extend decision algorithms to deal with additional predicates is described. T...
The problem is addressed of establishing the satisfiability of prenex formulas involving a single un...
We survey two series of results concerning the decidability of fragments of Tarksi's elementary alge...
Suppose we are given a mathematical theory. Is there an effective procedure which will enable us to ...
In the context of combinations of theories with disjoint signatures, we classify the component theor...
In the context of combinations of theories with disjoint signatures, we classify the component theor...
This paper surveys various decidability results in the set theory. In the first part, we focus on ce...
In the context of combinations of theories with disjoint signatures, we classify the component theor...
We consider positive rules in which the conclusion may contain existentially quantified variables, w...
The aim of these lectures is to give a clear and explicit overview of the most important decidable a...
The hierarchic superposition calculus over a theory T, called SUP(T), enables sound reasoning on the...
Abstract. This paper treats decision problexs for the intuitionistic logic without weak-ening rule F...
We consider positive rules in which the conclusion may contain existentially quantified variables, w...
The topic of this thesis is the extraction of efficient and readable programs from formal constructi...
In this paper we show that the usual intuitionistic characterization of the decidability of the prop...