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...
In this paper, we introduce multi-Jensen-cubic mappings and unify the system of functional equations defining the multi-Jensen-cubic mapping to a single equation. Applying a fixed point theorem, we establish the generalized Hyers-Ulam stability of multi-Jensen-cubic mappings. As a known outcome, we show that every approximate multi-Jensen-cubic mapping can be multi-Jensen-cubic.
The n-tuples of commuting Hilbert space contractions are considered. We give a model of a commuting lifting of one contraction and investigate conditions under which a commuting lifting theorem holds for an n-tuple. A series of such liftings leads to an isometric dilation of the n-tuple. The method is tested on some class of triples motivated by Parrotts example. It provides also a new proof of the...
In 2015, tense n × m-valued Lukasiewicz–Moisil algebras (or tense LMn×m-algebras) were introduced by A. V. Figallo and G. Pelaitay as an generalization of tense n-valued Łukasiewicz–Moisil algebras. In this paper we continue the study of tense LMn×m-algebras. More precisely, we determine a Priestley-style duality for these algebras. This duality enables us not only to describe the tense LMn×m-congruences...
The dynamic epistemic logic for actual knowledge models the phenomenon of actual knowledge change when new information is received. In contrast to the systems of dynamic epistemic logic which have been discussed in the past literature, our system is not burdened with the problem of logical omniscience, that is, an idealized assumption that the agent explicitly knows all classical tautologies and all...
Based on the hesitant fuzzy set theory which is introduced by Torra in the paper [12], the notions of Inf-hesitant fuzzy subalgebras, Inf-hesitant fuzzy ideals and Inf-hesitant fuzzy p-ideals in BCK/BCI-algebras are introduced, and their relations and properties are investigated. Characterizations of an Inf-hesitant fuzzy subalgebras, an Inf-hesitant fuzzy ideals and an Inf-hesitant fuzzy p-ideal...
This paper deals with pretabularity of fuzzy logics. For this, we first introduce two systems NMnfp and NM½, which are expansions of the fuzzy system NM (Nilpotent minimum logic), and examine the relationships between NMnfp and the another known extended system NM-. Next, we show that NMnfp and NM½ are pretabular, whereas NM is not. We also discuss their algebraic completeness.
In the present paper, we study in the harmonic analysis associated to the Weinstein operator, the boundedness on Lp of the uncentered maximal function. First, we establish estimates for the Weinstein translation of characteristic function of a closed ball with radius ε centered at 0 on the upper half space Rd-1× ]0,+∞[. Second, we prove weak-type L1-estimates for the uncentered maximal function associated...
This paper presents a theorem dealing with absolute matrix summability of infinite series. This theorem has been proved taking quasi β-power increasing sequence instead of almost increasing sequence.
This paper presents some generalizations of BCI algebras (the RM, tRM, *RM, RM**, *RM**, aRM**, *aRM**, BCH**, BZ, pre-BZ and pre-BCI algebras). We investigate the p-semisimple property for algebras mentioned above; give some examples and display various conditions equivalent to p-semisimplicity. Finally, we present a model of mereology without antisymmetry (NAM) which could represent a tRM algebra.
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.