The finite controllability of the Maslov case

&
Journal of Symbolic Logic 39 (3):509-518 (1974)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2272893

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,672

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Random models and the Maslov class.Warren Goldfarb - 1989 - Journal of Symbolic Logic 54 (2):460-466.
S. Ú. Maslov. О strogoj prédstavimosti množéstv isčisléniámi. Doklady Akadémii Nauk SSSR, Vol. 152 , pp. 272–274. - S. Ju. Maslov. Strong representability of sets by calculi. English translation of the preceding by Elliott Mendelson. Soviet mathematics, vol. 4 no. 5 , pp. 1292–1295. [REVIEW]E. M. Fels - 1967 - Journal of Symbolic Logic 32 (3):391-392.
S. Ú. Maslov. O nékotoryh sposobah zadaniá množéstv v bazisah poroždéniá. Doklady Akadémii Nauk SSSR, Vol. 153 , pp. 266–269. - S. Ju. Maslov. Some methods for the definition of sets in generating bases. English translation of the preceding by Avner Falk. Soviet mathematics, vol. 4 no. 6 , pp. 1649–1652. [REVIEW]E. M. Fels - 1967 - Journal of Symbolic Logic 32 (3):392-393.
Maslov S. Ú.. Préobrazovanié proizvol′nyh kanoničéskih isčislénij v kanoničéskié isčisléniá spécial′nyh tipov. Doklady Akadémii Nauk SSSR, vol. 147 , pp. 779–782.Maslov S. Ju.. Transformation of arbitrary canonical calculi into canonical calculi of special types. English translation of the preceding by Gdss R. N.. Soviet mathematics, vol. 3 no. 6 , pp. 1708–1711. [REVIEW]E. M. Fels - 1968 - Journal of Symbolic Logic 32 (4):527-527.
Controllability and Optimization of Complex Networks Based on Bridges.Lifu Wang, Guotao Zhao, Zhi Kong & Yunkang Zhao - 2020 - Complexity 2020:1-10.
The effect of controllability and causality on counterfactual thinking.Caren A. Frosch, Suzanne M. Egan & Emily N. Hancock - 2015 - Thinking and Reasoning 21 (3):317-340.
Pseudo-finite homogeneity and saturation.Jörg Flum & Martin Ziegler - 1999 - Journal of Symbolic Logic 64 (4):1689-1699.
Pseudo-Finite Homogeneity and Saturation.Jorg Flum & Martin Ziegler - 1999 - Journal of Symbolic Logic 64 (4):1689-1699.
S. Ú. Maslov, G. É. Minc, and V. P. Orévkov. Nérazréšimost′ ν konstruktivnom isčislénii prédikatov nékotoryh klassov formul, sodéržaščih tol′ko odnoméstnyé prédikatnyé péréménnyé. Doklady Akadémii Nauk, vol. 163 , pp. 295–297. - S. Ju. Maslov, G. E. Minc, and V. P. Orevkov. Unsolvability in the constructive predicate calculus of certain classes of formulas containing only monadic predicate variables. Translation of the preceding by E. Mendelson. Soviet mathematics, vol. 6 , pp. 918–920. [REVIEW]Georg Kreisel - 1970 - Journal of Symbolic Logic 35 (1):143-144.
New exact quasi-classical asymptotic beyond WKB approximation and beyond Maslov formal expansion.Jaykov Foukzon - 2015 - Journal of Physics: Conference Series 633 (1):`1-5.
On Preservation of Stability for Finite Extensions of Abelian Groups.Frieder Haug - 1994 - Mathematical Logic Quarterly 40 (1):14-26.
Not Wholly Finite: The Dual Aspect of Finite Modes in Spinoza.Noa Shein - 2018 - Philosophia 46 (2):433-451.
Locally finite weakly minimal theories.James Loveys - 1991 - Annals of Pure and Applied Logic 55 (2):153-203.
About finite predicate logic.Herman Dishkant - 1986 - Studia Logica 45 (4):405 - 414.
Relativised Homomorphism Preservation at the Finite Level.Lucy Ham - 2017 - Studia Logica 105 (4):761-786.

Analytics

Added to PP
2009-01-28

Downloads
212 (#94,246)

6 months
6 (#507,808)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Warren Goldfarb
Harvard University

Citations of this work

Add more citations

References found in this work

Solvable Cases of the Decision Problem.[author unknown] - 1956 - Philosophy 31 (116):92-93.

Add more references