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 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...

Introduction to the Special Issue.

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...

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.

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 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...

This note provides a review of the book 'On the Sea-Battle Tomorrow That May Not Happen' by Tomasz Jarmużek.

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.

We consider the classic spring-mass model of running which is built upon an inverted elastic pendulum. In this paper we introduce new approximate solution of an interesting boundary value problem for the governing system of two nonlinear ordinary differential equations, which in a natural way we get in this model. We give theoretical support by deriving asymptotic behaviour of obtained approximations...

Variational methods for solving nonlinear equations (differential, integral, etc.) are perhaps the most common methods at the present time. However, the history of their origin and development, both in the USSR and in the whole world, has not been studied enough. The author attempts to fill this gap, limiting himself mainly to 1920's-1950's, starting with Hilbert’s works on justification of Dirichlet...

Chance has always accompanied man. He was afraid of the elusive forces behind him, but he was also fascinated. Relatively late from this fascination arose the understanding that in some circumstances chance can be measured and, consequently, with the help of mathematics to reveal the regularities behind it. It began with gambling games already known in ancient times, such as the dice game popular...

We apply multitype, continuous time, Markov branching models to study pathogenicity in E. coli, a bacterium belonging to the genus Escherichia. First, we examine briefly, the properties of multitype branching processes and we also survey some fundamental limit theorems regarding the behavior of such models under various conditions. These theorems are then applied to discrete, state dependent models,...

We define Kripke semantics for propositional intuitionistic logic with Suszko’s identity (ISCI). We propose sequent calculus for ISCI along with cut-elimination theorem. We sketch a constructive interpretation of Suszko’s propositional identity connective.

Sentences containing definite descriptions, expressions of the form `The F', can be formalised using a binary quantier that forms a formula out of two predicates, where ℩x[F;G] is read as `The F is G'. This is an innovation over the usual formalisation of definite descriptions with a term forming operator. The present paper compares the two approaches. After a brief overview of the system INF℩ of...

The main purpose of this paper is to give alternative proofs of syntactical and semantical properties, i.e. the subformula property and the nite model property, of the sequent calculi for the modal logics K4.3, KD4.3, and S4.3. The application of the inference rules is said to be acceptable, if all the formulas in the upper sequents are subformula of the formulas in lower sequent. For some modal logics,...

The concept of multiple-conclusion consequence relation from [8] and [7] is considered. The closure operation C assigning to any binary relation r (dened on the power set of a set of all formulas of a given language) the least multiple-conclusion consequence relation containing r, is dened on the grounds of a natural Galois connection. It is shown that the very closure C is an isomorphism from the...

Our aim is to overview and discuss some of the most popular approaches to the notion of a tolerance relation in algebraic structures with the special emphasis on lattices.