Bioassessment is the process of using living organisms to assess the ecological health of a particular ecosystem. It typically relies on identifying specific organisms that are sensitive to changes in environmental conditions. Benthic macroinvertebrates are widely used for examining the ecological status of freshwaters. However, a time-consuming process of species identification that requires high expertise represents one of the key obstacles to more precise bioassessment of aquatic ecosystems. Partial automation of this process using deep learning-based image classification is the goal (...) of an ongoing project AIAQUAMI we are participating in. One of the project goals is to develop software support for image classification with visualization and reporting. For that purpose, we developed desktop and web applications that we open-sourced as Imagelytics Suite. Both desktop and web applications rely on a convolutional neural network (CNN) to classify images and the Grad-CAM algorithm to produce heatmaps of the image areas that mostly influenced the network decision. Along with the source code of the applications, we also open-sourced scripts that can be used to train CNN on an arbitrary dataset and produce required metadata, so it can be used with Imagelytics applications. In this article, we presented technical details regarding the design of the applications and the training method that will enable their general use for image classification tasks. As a part of the evaluation, we will show a use case related to species identification of non-biting midges (Diptera: Chironomidae). (shrink)

Based on an analysis of the category of “infinite judgments” in Kant, we will introduce the logical hexagon of predicate negation. This hexagon allows us to visualize in a single diagram the general structure of both Kant’s solution of the antinomies of pure reason and his argument in favor of Transcendental Idealism.

In recent years combinations of tense and modality have moved intothe focus of logical research. From a philosophical point of view, logical systems combining tense and modality are of interest because these logics have a wide field of application in original philosophical issues, for example in the theory of causation, of action, etc. But until now only methods yielding completeness results for propositional languages have been developed. In view of philosophical applications, analogous results with respect to languages of predicate (...) logic are desirable, and in this paper I present two such results. The main developments in this area can be split into two directions, differing in the question whether the ordering of time is world-independent or not. Semantically, this difference appears in the discussion whether T x W-frames or Kamp-frames (resp. Ockham-frames) provide a suitable semantics for combinations of tense and modality. Here, two calculi are presented, the first adequate with respect to Kamp-semantics, the second to T x Wsemantics. (Both calculi contain an appropriate version of Gabbay's irreflexivity rule.) Furthermore, the proposed constructions of canonical frames simplify some of those which have hitherto been discussed. (shrink)

Logicians have often suggested that the use of Euler-type diagrams has influenced the idea of the quantification of the predicate. This is mainly due to the fact that Euler-type diagrams display more information than is required in traditional syllogistics. The paper supports this argument and extends it by a further step: Euler-type diagrams not only illustrate the quantification of the predicate, but also solve problems of traditional proof theory, which prevented an overall quantification of the predicate. Thus, (...) Euler-type diagrams can be called the natural basis of syllogistic reasoning and can even go beyond. In the paper, these arguments are presented in connection with the book Nucleus Logicae Weisaniae by Johann Christian Lange from 1712. (shrink)

Noun phrases with overt determiners, such as <i>some apples</i> or <i>a quantity of milk</i>, differ from bare noun phrases like <i>apples</i> or <i>milk</i> in their contribution to aspectual composition. While this has been attributed to syntactic or algebraic properties of these noun phrases, such accounts have explanatory shortcomings. We suggest instead that the relevant property that distinguishes between the two classes of noun phrases derives from two modes of existential quantification, one of which holds the values of a variable fixed (...) throughout a quantificational context while the other allows them to vary. Inspired by Dynamic Plural Logic and Dependence Logic, we propose Plural Predicate Logic as an extension of Predicate Logic to formalize this difference. We suggest that temporal <i>for</i>-adverbials are sensitive to aspect because of the way they manipulate quantificational contexts, and that analogous manipulations occur with spatial <i>for</i>-adverbials, habituals, and the quantifier <i>all</i>. (shrink)

According to what I call the ‘Vagueness Thesis’ about belief, ‘believes’ is a vague predicate. On this view, our concept of belief admits of borderline cases: one can ‘half-believe’ something or be ‘in-between believing’ it. In this article, I argue that VT is false and present an alternative picture of belief. I begin by considering a case—held up as a central example of vague belief—in which someone sincerely claims something to be true and yet behaves in a variety of (...) other ways as if she believes that it is not. I argue that, even from the third-person perspective prioritised by proponents of VT, the case does not motivate VT. I present an alternative understanding of the case according to which the person in question believes as they say they do yet also has a belief-discordant implicit attitude otherwise. Moreover, I argue that, independently of the interpretation of any particular case, VT fails to accommodate the first-person perspective on belief. Belief is not only an item of one’s psychology that helps explain one’s behaviour; it is what one takes to be true. This fact about belief manifests itself in the nature of deliberation concerning whether to believe something and that of introspection regarding whether one believes something. Attending to these phenomena reveals that VT is not merely unmotivated, but untenable. (shrink)

Rational Pavelka logic extends Lukasiewicz infinitely valued logic by adding truth constants r̄ for rationals in [0, 1]. We show that this is a conservative extension. We note that this shows that provability degree can be defined in Lukasiewicz logic. We also give a counterexample to a soundness theorem of Belluce and Chang published in 1963.

This paper investigates a first-order extension of GL called \. We outline briefly the history that led to \, its key properties and some of its toolbox: the \emph{conservation theorem}, its cut-free Gentzenisation, the ``formulators'' tool. Its semantic completeness is fully stated in the current paper and the proof is retold here. Applying the Solovay technique to those models the present paper establishes its main result, namely, that \ is arithmetically complete. As expanded below, \ is a first-order modal logic (...) that along with its built-in ability to simulate general classical first-order provability―"\" simulating the the informal classical "\"―is also arithmetically complete in the Solovay sense. (shrink)

For each intermediate propositional logicJ, J * denotes the least predicate extension ofJ. By the method of canonical models, the strongly Kripke completeness ofJ *+D(=x(p(x)q)xp(x)q) is shown in some cases including:1. J is tabular, 2. J is a subframe logic. A variant of Zakharyashchev's canonical formulas for intermediate logics is introduced to prove the second case.

In the last few decades many formal systems of fuzzy logics have been developed. Since the main differences between fuzzy and classical logics lie at the propositional level, the fuzzy predicate logics have developed more slowly (compared to the propositional ones). In this text we aim to promote interest in fuzzy predicate logics by contributing to the model theory of fuzzy predicate logics. First, we generalize the completeness theorem, then we use it to get results on conservative (...) extensions of theories and on witnessed models. (shrink)

We prove that the positive fragment of first-order intuitionistic logic in the language with two individual variables and a single monadic predicate letter, without functional symbols, constants, and equality, is undecidable. This holds true regardless of whether we consider semantics with expanding or constant domains. We then generalise this result to intervals \ and \, where QKC is the logic of the weak law of the excluded middle and QBL and QFL are first-order counterparts of Visser’s basic and formal (...) logics, respectively. We also show that, for most “natural” first-order modal logics, the two-variable fragment with a single monadic predicate letter, without functional symbols, constants, and equality, is undecidable, regardless of whether we consider semantics with expanding or constant domains. These include all sublogics of QKTB, QGL, and QGrz—among them, QK, QT, QKB, QD, QK4, and QS4. (shrink)

• The transitive closure of R is the smallest relation S for which: –R⊆S, – S is transitive. • To express ^r one would need an ‘infinite formula’: {(x, y) | R(x, y) ∨ ∃z(R(x, z) ∧ R(z, y)) ∨∃z, v(R(x, z) ∧ R(z, v) ∧ R(v, y)) ∨∃z, v, w(R(x, z) ∧ R(z, v) ∧ R(v, w) ∧ R(w, y)) ∨ · · ·.

This essay is devoted to an analysis of the semantic significance of a fashionable view of proper names, the Predicate Theory of names, typically developed in the direction of the Metalinguistic Theory of names. According to MT, ‘syntactic evidence supports the conclusion that a name such as ‘Kennedy’ is analyzable in terms of the predicate ‘individual named ‘Kennedy’’. This analysis is in turn alleged to support a descriptivist treatment of proper names in designative position, presumably in contrast with (...) theories of names as ‘directly referring rigid designators’. The main aim of this essay is that of questioning the significance of PT and MT as theories of designation: even granting for the argument’s sake that names are analyzable as predicates, their designative occurrences may be interpreted in consonance with the dictates of Direct Reference—indeed, in consonance with the radically anti-descriptivist version of Direct Reference I call Millianism. (shrink)

In previous work by Baaz and Iemhoff, a Gentzen calculus for intuitionistic logic with existence predicate is presented that satisfies partial cut elimination and Craig's interpolation property; it is also conjectured that interpolation fails for the implication-free fragment. In this paper an equivalent calculus is introduced that satisfies full cut elimination and allows a direct proof of interpolation via Maehara's lemma. In this way, it is possible to obtain much simpler interpolants and to better understand and overcome the failure (...) of interpolation for the implication-free fragment. (shrink)

Modal counterparts of intermediate predicate logics will be studied by means of algebraic devise. Our main tool will be a construction of algebraic semantics for modal logics from algebraic frames for predicate logics. Uncountably many examples of modal counterparts of intermediate predicate logics will be given.

We introduce Gentzen calculi for intuitionistic logic extended with an existence predicate. Such a logic was first introduced by Dana Scott, who provided a proof system for it in Hilbert style. We prove that the Gentzen calculus has cut elimination in so far that all cuts can be restricted to very simple ones. Applications of this logic to Skolemization, truth value logics and linear frames are also discussed.

What precisely are fragments of classical first-order logic showing “modal” behaviour? Perhaps the most influential answer is that of Gabbay 1981, which identifies them with so-called “finite-variable fragments”, using only some fixed finite number of variables (free or bound). This view-point has been endorsed by many authors (cf. van Benthem 1991). We will investigate these fragments, and find that, illuminating and interesting though they are, they lack the required nice behaviour in our sense. (Several new negative results support this claim.) (...) As a counterproposal, then, we define a large fragment of predicate logic characterized by its use of only bounded quantification. This so-called guarded fragment enjoys the above nice properties, including decidability, through an effectively bounded finite model property. (These are new results, obtained by generalizing notions and techniques from modal logic.) Moreover, its own internal finite variable hierarchy turns out to work well. Finally, we shall make another move. The above analogy works both ways. Modal operators are like quantifiers, but quantifiers are also like modal operators. This observation inspires a generalized semantics for first-order predicate logic with accessibility constraints on available assignments (cf. N´emeti 1986, 1992) which moves the earlier quantifier restrictions into the semantics. This provides a fresh look at the landscape of possible predicate logics, including candidates sharing various desirable features with basic modal logic – in particular, its decidability. (shrink)

Joan Weiner has recently claimed that Frege neither uses, nor has any need to use, a truth-predicate in his justification of the logical laws. She argues that because of the assimilation of sentences to proper names in his system, Frege does not need to make use of the Quinean device of semantic ascent in order to formulate the logical laws, and that the predicate ‘is the True’, which is used in Frege's justification, is not to be considered as (...) a truth-predicate, because it does not apply to true sentences or true thoughts. The present paper aims to show that Frege needs to use, and does use, a truth-predicate in this context. It is argued, first, that Frege needs to use a truthpredicate in order to show that the truth of the logical laws is evident from the senses of the sentences by means of which they are formulated, and second, that the predicate that he actually uses, ‘is the True’, must be considered as a truth-predicate in the relevant sense, because it can be used and is actually used by Frege to explain the truth-conditions of thoughts. To defend this interpretation, it is discussed whether the explanatory use of ‘is the True’ in Frege's system is compatible with his deflationary analysis of ‘true’. The paper's conclusion is that there is indeed a conflict here; but, from Frege's point of view, this conflict is due merely to the logical imperfection of natural language and does not affect the proper system but only its propaedeutic. (shrink)

We consider the desirability, or otherwise, of various forms of induction in the light of certain principles and inductive methods within predicate uncertain reasoning. Our general conclusion is that there remain conflicts within the area whose resolution will require a deeper understanding of the fundamental relationship between individuals and properties.