The theory of one-step rewriting for a given rewrite system R and signature C is the firstorder theory of the following structure: its universe consists of all C-ground terms, and its only predicate is the relation "x rewrites to y in one step by R". The structure contains no function symbols and no
First-Order Frege Theory is Undecidable
β Scribed by Warren Goldfarb
- Book ID
- 110321369
- Publisher
- Springer Netherlands
- Year
- 2001
- Tongue
- English
- Weight
- 48 KB
- Volume
- 30
- Category
- Article
- ISSN
- 0022-3611
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Abstract The ambiguous type theory ATT is introduced in [1] in order to obtain a new proof of Specker's theorem on typical ambiguity [3]. In the present paper we imbed the recursively undecidable theory TR of a single transitiveβreflexive relation in an arbitrary stratified theory T such that T
Mathematical Logic for Computer Science is a mathematics textbook with theorems and proofs, but the choice of topics has been guided by the needs of students of computer science. The method of semantic tableaux provides an elegant way to teach logic that is both theoretically sound and easy to under