Let .EOA be the elementary ontology augmented by an additional axiom 3S (S 9 S), and let ~8 be the monadic second-order predicate logic. We show that the mapping ~ which was introduced by V. A. Smirnov is an embedding of EOA into LS. We also give an embedding of ZS into EOA. In Smirnov [3], he defi
Elementary embeddings and games in adapted probability logic
โ Scribed by Sergio Fajardo
- Publisher
- Springer
- Year
- 1990
- Tongue
- English
- Weight
- 624 KB
- Volume
- 30
- Category
- Article
- ISSN
- 0933-5846
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
## Abstract In this paper we show some nonโelementary speedโups in logic calculi: Both a predicative secondโorder logic and a logic for fixed points of positive formulas are shown to have nonโelementary speedโups over firstโorder logic. Also it is shown that eliminating secondโorder cut formulas in
Both social cooperation and self!control require reciprocation[ In social coop! eration situations a single person|s cooperative act\ if not reciprocated by others\ would be unreinforced both immediately and in the long term[ Similarly\ a single act of self!control "refusing a single cigarette\ for