Persistent and invariant formulas for outer extensions
Solomon Feferman (1968)
Compositio Mathematica
Similarity:
Displaying similar documents to “Descriptive Set Theory and Infinitary Languages”
Persistent and invariant formulas for outer extensions
Generalizing Vaught sentences from ω to strong cofinality ω
M. Makkai (1974)
Fundamenta Mathematicae
Similarity:
Finite models and finitely many variables
Anuj Dawar (1999)
Banach Center Publications
Similarity:
This paper is a survey of results on finite variable logics in finite model theory. It focusses on the common underlying techniques that unite many such results.
Reasoning in Basic Description Logics and Description Logics with Modal Operators
Milenko Mosurović, Tatjana Stojanović, Ana Kaplarević-Mališić (2009)
Zbornik Radova
Similarity:
A compactness result concerning direct products of models
M. Makkai (1965)
Fundamenta Mathematicae
Similarity:
Antinomy of “Liar” and antinomy of synonymous names
Ladislav Tondl (1966)
Kybernetika
Similarity:
Two notes on abstract model theory. II. Languages for which, the set of valid sentences is semi-invariantly implicitly definable
Solomon Feferman (1975)
Fundamenta Mathematicae
Similarity:
On one of the boundaries of the constituent conception of grammar
Ladislav Nebeský (1971)
Kybernetika
Similarity:
Computational logics and the philosophy of language: the problem of lexical meaning in formal semantics.
Marcello Frixione (1996)
Mathware and Soft Computing
Similarity:
This paper deals with the possible contributions that logical researches carried on in the field of artificial intelligence (AI) could give to formal theories of meaning developed by logically oriented philosophers of language within the tradition of analytic philosophy. In particular, I will take into account a topic which is problematic in many respects for traditional logical accounts of meaning, i.e., the problem of lexical semantics. My thesis is that AI logics could give useful...