Displaying similar documents to “Completeness, Categoricity and Imaginary Numbers: The Debate on Husserl”

There is no complete axiom system for shuffle expressions

A. Szepietowski (2010)

RAIRO - Theoretical Informatics and Applications

Similarity:

In this paper we show that neither the set of all valid equations between shuffle expressions nor the set of schemas of valid equations is recursively enumerable. Thus, neither of the sets can be recursively generated by any axiom system.

Contexts, locality and generality.

Paolo Bouquet, Enrico Giunchiglia, Fausto Giunchiglia (1996)

Mathware and Soft Computing

Similarity:

It has been recognized that AI programs suffer from a lack of generality, the first gross symptom being that a small variation to the problem being solved usually causes a major revision of the theory describing it. The lack of generality seems an unavoidable consequence of the process of approximating the world while building theories about it. In this paper we propose an approach where generality is achieved by formulating, for each problem at hand, an appropriate local theory, a theory...

On a Certain Notion of Finite and a Finiteness Class in Set Theory without Choice

Horst Herrlich, Paul Howard, Eleftherios Tachtsis (2015)

Bulletin of the Polish Academy of Sciences. Mathematics

Similarity:

We study the deductive strength of properties under basic set-theoretical operations of the subclass E-Fin of the Dedekind finite sets in set theory without the Axiom of Choice ( AC ), which consists of all E-finite sets, where a set X is called E-finite if for no proper subset Y of X is there a surjection f:Y → X.