What people are saying - Write a review
We haven't found any reviews in the usual places.
Some Connections Between Set Theory and Computer Science
Epistemic Entrenchment and Arithmetical Hierarchy Abstract
13 other sections not shown
Other editions - View all
algorithm application arithmetic atomic autoepistemic logic Automated Theorem Proving axiom system bounded called cautious expansions complete Computer Science connection consider consistent constraint construct contains corresponding cutformula deduction default logic defined definition denote derivation Derv elements equations equivalent example exists exponential extension finite set first-order flat clauses fp(rf function symbols given Glww goal Godel graph Horn clause hypergraph induction inference rules interpretation introduced introspection intuitionistic logic IS(A language Lemma linear logic literals logic programming Mathematical modal formula modal logic natural deduction natural numbers negation nonmonotonic logic notion obtained occurring operator parameter Peano Arithmetic polynomial predicate symbol problem properties propositional provable quantifiers r.e. set recursive relation resolution result rule of inference satisfiable saturated Satw semantics sentence sequent calculus set of clauses set of premises Skolem stable expansion structure subset substitution superposition calculus tableau tautology Theorem Proving theory undecidable