This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
J.P. Cleave, The notion of logical consequence in the logic with inexact predicates, Zeitschrift für Math. Logik und Grundlagen der Mathematik 20 (1974), 307–324.
K. Čuda, Contributions to the theory of semisets III, Ibid. 19 (1973), 399–406.
J. Flum, First order logic and its extensions, Notes for the Course in Model Theory, Kiel 1974.
P. Hájek, Problém obecného pojetí metody GUHA (in Czech), Kybernetika 6 (1968), 505–515.
P. Hájek, Automatic listing of important observational statements I, II, III, Ibid. 9 1973, 187–205, 251–271 and 10 1974 95–124.
P. Hájek, Some logical problems of automated research. Proceedings of the Symposium on Mathematical Foundations of Computer Science, High Tatras 1973, p. 85–93.
P. Hájek, Generalized quantifiers and finite sets. Proceedings of the Autumn School in Set Theory and Hierarchy Theory, Karpacz (Poland) 1974, to appear.
P. Hájek, Observationsfuntorenkalküle und die Logik der automatisierten Forschung. Elektronische Informationenverarbeitung und Kybernetik, to appear.
P. Hájek, Projective classes of models in observational predicate calculi. Preprint for the 5th International Congress for Logic, Methodology and Philosophy of Science, London (Ontario) 1975.
P. Hájek, Contributions to the theory of semisets I, Zeitschrift für Math. Logik und Grundlagen der Mathematik 18 1972, 241–248.
P. Hájek, Why semisets? Commentationes Math. Univ. Caroline 14 1973, 397–420.
P. Hájek, I. Havel and M. Chytil, The GUHA method of automatic hypotheses determination. Computing 1 (1966), 293–308.
P. Hájek and T. Havránek, A logic of automated discovery. Monograph in preparation.
T. Havránek, A class of automatic methods of data processing; an application to searching of regression models. Proceedings of the European Meeting of Statisticians and the 7th Prague international Conference in Information Theory, to appear.
T. Havránek, Statistical quantifiers in observational calculi: an application in GUHA methods. Theory and Decision 3 (1975), to appear.
T. Havránek, this volume, pp. 258–265.
D. S. Johnson, P. Gécs and L. Lovász, Pseudoelementary classes of finite structures and polynomial completeness, to appear.
R. M. Karp, Reducibility among combinatory problems. Complexity of Computer Computations, Plenum Press 1972, p. 85–103.
R. Kowalski, Logic for problem solving. Memo No. 75, Department of Computational Logic, University of Edinburgh 1974.
B. Meltzer, Generation of hypotheses and theories. Nature 225, March 1970, p. 972.
G.C. Morgan, Hypothesis generation by machine, Artificial Intelligence 2 (1971), 179–188.
G.D. Plotkin, A further note on inductive generalization. Machine Intelligence 6 (1971), 101–124.
P. Pudlák, The observational predicate calculus and polynomial complexity. Commentationes Math. Univ. Carolinae 16 (1975), to appear.
P. Pudlák, this volume, pp. 358–361.
L.H. Tharp, The characterization of monadic logic. Journal of Symbolic Logic 38 (1973), 481–488.
P. Vopěnka and P. Hájek, The theory of semisets. North-Holland Publ. Comp. 1972.
B.A. Trakhtenbrot, this volume, pp. 125–137.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1975 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hájek, P. (1975). On logics of discovery. In: Bečvář, J. (eds) Mathematical Foundations of Computer Science 1975 4th Symposium, Mariánské Lázně, September 1–5, 1975. MFCS 1975. Lecture Notes in Computer Science, vol 32. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-07389-2_180
Download citation
DOI: https://doi.org/10.1007/3-540-07389-2_180
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-07389-5
Online ISBN: 978-3-540-37585-2
eBook Packages: Springer Book Archive