The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In the paper, various notions of the logical semiotic sense of linguistic expressions – namely, syntactic and semantic, intensional and extensional – are considered and formalised on the basis of a formal-logical conception of any language L characterised categorially in the spirit of certain Husserl's ideas of pure grammar, Leśniewski-Ajdukiewicz's theory of syntactic/semantic categories and, in...
We prove a characterization theorem for filters, proper filters and ultrafilters which is a kind of converse of Łoś's theorem. It is more natural than the usual intuition of these terms as large sets of coordinates, which is actually unconvincing in the case of ultrafilters. As a bonus, we get a very simple proof of Łoś's theorem.
In his 1887's Mitteilungen zur Lehre von Transfiniten, Cantor seeks to prove inconsistency of infinitesimals. We provide a detailed analysis of his argument from both historical and mathematical perspective. We show that while his historical analysis are questionable, the mathematical part of the argument is false.
Husserl's two notions of "definiteness" enabled him to clarify the problem of imaginary numbers. The exact meaning of these notions is a topic of much controversy. A "definite" axiom system has been interpreted as a syntactically complete theory, and also as a categorical one. I discuss whether and how far these readings manage to capture Husserl's goal of elucidating the problem...
Three variants of Kurt Gödel's ontological argument, proposed by Dana Scott, C. Anthony Anderson and Melvin Fitting, are encoded and rigorously assessed on the computer. In contrast to Scott's version of Gödel's argument the two variants contributed by Anderson and Fitting avoid modal collapse. Although they appear quite different on a cursory reading they are in fact closely related. This has been...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.