William Craig’s scientific contributions

What is this page?


This page lists works of an author who doesn't have a ResearchGate profile or hasn't added the works to their profile yet. It is automatically generated from public (personal) data to further our legitimate goal of comprehensive and accurate scientific recordkeeping. If you are this author and want this page removed, please let us know.

Publications (1)


Finite Axiomatizability Using Additional Predicates
  • Article

September 1958

·

9 Reads

·

81 Citations

Journal of Symbolic Logic

William Craig

·

Robert L. Vaught

By a theory we shall always mean one of first order, having finitely many non-logical constants. Then for theories with identity (as a logical constant, the theory being closed under deduction in first-order logic with identity), and also likewise for theories without identity, one may distinguish the following three notions of axiomatizability. First, a theory may be recursively axiomatizable, or, as we shall say, simply, axiomatizable . Second, a theory may be finitely axiomatizable using additional predicates ( f. a. +), in the syntactical sense introduced by Kleene [9]. Finally, the italicized phrase may also be interpreted semantically. The resulting notion will be called s. f. a. +. It is closely related to the modeltheoretic notion PC introduced by Tarski [16], or rather, more strictly speaking, to PC ∩ AC δ . For arbitrary theories with or without identity, it is easily seen that s. f. a .+ implies f. a .+ and it is known that f. a. + implies axiomatizability. Thus it is natural to ask under what conditions the converse implications hold, since then the notions concerned coincide and one can pass from one to the other. Kleene [9] has shown: (1) For arbitrary theories without identity, axiomatizability implies f. a. +. It also follows from his work that : (2) For theories with identity which have only infinite models, axiomatizability implies f. a. +.

Citations (1)


... 7, not every recursively pseudo-elementary class is finitely pseudo-elementary, this result is interesting in its own right. Extending the terminology of Craig and Vaught (1958), it means that every recursive theory is finitely axiomatizable (in the semantic sense) using additional predicates and entities: Together with Theorem 5, the desired result follows immediately: ...

Reference:

On the indispensability of theoretical terms and entities
Finite Axiomatizability Using Additional Predicates
  • Citing Article
  • September 1958

Journal of Symbolic Logic