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)

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)

According to a common definition, the argument of truthful ones is an argument in which the existence of Necessary Being is proved with no presumption of the existence of the possible being. Avicenna proposed different versions of this style of argument and the version in the book of Nejat is one of them. This paper is intended to examine the possibility of proving the logical validity of this version in first-order predicate logic and explain the principles which the argument (...) is based on. In this way, it becomes clear to what extent Avicenna's version is in accordance with the criteria he himself introduces for the argument of truthful ones. In this respect, while providing a clear exposition of the version in the book of Nejat, bugs on some of the statements and proposals to obviate them in terms of replacement arises. Then explaining the concepts and premises which the argument in the book of Nejat is besed on, it is formulated in first-order predicate logic with its full proof. Finally, the proposed model's accordance with the presented criteria for the argument of truthful ones will be shown. (shrink)

I begin with an exposition of the two main variants of the Prosentential Theory of Truth (PT), those of Dorothy Grover et al. and Robert Brandom. Three main types of criticisms are then put forward: (1) material criticisms to the effect that (PT) does not adequately explain the linguistic data, (2) an objection to the effect that no variant of (PT) gives a properly unified account of the various occurrences of "true" in English, and, most importantly, (3) a charge that (...) the comparison with proforms is explanatorily idle. The last objection is that, given a complete semantic account of pronouns, proadjectives, antecedents, etc., together with a complete (PT), the essential semantic character of "true" could be deduced, but then, the idleness of the comparison with pronouns would be apparent. It turns out that objections (2) and (3) are related in the following way: the prosentential terminology is held to conceal the lack of unity in (PT), by describing the different data in the same terms ("proform", "antecedent", etc.). But this, I argue, is only a way of truly describing, rather than explaining, the data, these being certain relations of equivalence and consequence between sentences. I consider a language for which (PT) would be not only true, but also explanatory, but note that this language is very different from English. I end by showing that Robert Brandom's case that "is true" is not a predicate fails, and that his motivation for saying so is based on fallacious reasoning (namely, Boghossian's argument against deflationism). (shrink)

In this essay, I argue for the conclusion that the Chinese sentences that are regularly translated into subject-predicate sentences in English may be understood as all non-subject-predicate sentences. My argument is based on the premise that some grammatical features are crucial to yield the sense of contrast between the completeness of subject and the incompleteness of predicate. The absence of such grammatical features in Chinese makes it impossible to establish any criterion for the distinction between subject and (...) predicate in Chinese. (shrink)

Taking the semantic values of predicates to be precise properties leaves no room for predicate vagueness. I suggest instead understanding talk of properties as used in semantics as idealized placeholders for the imprecise results of navigating the word/world interface. Basic predications result by applying imprecise informal rules of word use, and it is in the imprecision of these rules that vagueness arises. The idealized property-placeholders then function to separate the messy process of navigating the word/world interface from the exact (...) rules of semantic composition. This scheme applies a methodology of problem separation that is well known in the physical sciences. (shrink)

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 define notions of homomorphism, submodel, and sandwich of Kripke models, and we define two syntactic operators analogous to universal and existential closure. Then we prove an intuitionistic analogue of the generalized (dual of the) Lyndon-Łoś-Tarski Theorem, which characterizes the sentences preserved under inverse images of homomorphisms of Kripke models, an intuitionistic analogue of the generalized Łoś-Tarski Theorem, which characterizes the sentences preserved under submodels of Kripke models, and an intuitionistic analogue of the generalized Keisler Sandwich Theorem, which characterizes the (...) sentences preserved under sandwiches of Kripke models. We also define several intuitionistic formula hierarchies analogous to the classical formula hierarchies $\forall_n (= \Pi^0_n)$ and $\exists_n (=\Sigma^0_n)$ , and we show how our generalized syntactic preservation theorems specialize to these hierarchies. Each of these theorems implies the corresponding classical theorem in the case where the Kripke models force classical logic. (shrink)

Recent studies in semantics of modal and superintuitionistic predicate logics provided many examples of incompleteness, especially for Kripke semantics. So there is a problem: to find an appropriate possible- world semantics which is equivalent to Kripke semantics at the propositional level and which is strong enough to prove general completeness results. The present paper introduces a new semantics of Kripke metaframes' generalizing some earlier notions. The main innovation is in considering "n"-tuples of individuals as abstract "n"-dimensional vectors', together with (...) some transformations of these vectors. Soundness of the semantics is proved to be equivalent to some non- logical properties of metaframes; and thus we describe the maximal semantics of Kripke- type. (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)

Although a great deal has been written concerning the verifiability of empirical, declarative sentences, yet some further clarification in this area seems possible and desirable. I think it is important to determine what sort of property ‘verified by’ is. Obviously it is a semiotical property. Only sentences, never matters of fact, are verified. But where, in the area of semiotics, is it to be placed? To use Charles Morris's useful and now somewhat traditional classification, is it a syntactic, semantic, or (...) pragmatic predicate? My answer is that it falls within semantics. Before developing this, however, I should like to point out why I do not place it in either of the other two subdivisions. (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)

In this paper, a semantics for predicate logics without the contraction rule will be investigated and the completeness theorem will be proved. Moreover, it will be found out that our semantics has a close connection with Beth-type semantics.

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)

The predicate view on proper names opts for a uniform semantic representation of proper nouns like ‘Alfred’ as predicates on the level of logical form. Early defences of this view can be found in Sloat (Language, vol. 45, pp. 26–30, 1969) and Burge (J. Philos. 70: 425–439, 1973), but there is an increasing more recent interest in this view on proper names. My paper aims to provide a reconstruction and critique of Burge’s main argument for the predicate view (...) on proper names, which is still used by several current philosophers in defence of this view. I have called this argument the unification argument. I will present a stepwise interpretation and reconstruction of this argument, consider several possible responses to it and defend a specific response to it in detail. (shrink)

The traditional square of opposition is generalized and extended to a cube of opposition covering and conveniently visualizing inter-sentential oppositions in relational syllogistic logic with the usual syllogistic logic sentences obtained as special cases. The cube comes about by considering Frege–Russell’s quantifier predicate logic with one relation comprising categorical syllogistic sentence forms. The relationships to Buridan’s octagon, to Aristotelian modal logic, and to Klein’s 4-group are discussed.GraphicThe photo shows a prototype sculpture for the cube.

Mirdamad, a prominent philosopher of the Late Medieval Period active in the Islamic world, regards existence as nothing in reality. In this paper, I employ methods devised by contemporary analytic...

In so-called Kripke-type models, each sentence is assigned either to true or to false at each possible world. In this setting, every possible world has the two-valued Boolean algebra as the set of truth values. Instead, we take a collection of algebras each of which is attached to a world as the set of truth values at the world, and obtain an extended semantics based on the traditional Kripke-type semantics, which we call here the algebraic Kripke semantics. We introduce algebraic (...) Kripke sheaf semantics for super-intuitionistic and modal predicate logics, and discuss some basic properties. We can state the Gödel-McKinsey-Tarski translation theorem within this semantics. Further, we show new results on super-intuitionistic predicate logics. We prove that there exists a continuum of super-intuitionistic predicate logics each of which has both of the disjunction and existence properties and moreover the same propositional fragment as the intuitionistic logic. (shrink)

In his Moderate Realism and Its Logic (Yale, 1996), Donald Mertz argues that the traditional ontology of nonpredicable substances and predicable universals is beset by “intractable problems,” “harbors an insidious error,” and constitutes a “stumbling block” for the ontologist. By contrast, a onecategory ontology consisting of relation instances (and combinations thereof) is sustainable, and indeed the only way of avoiding commitment to bare particulars. The success of the project turns on Mertz’s claim that every relation instance has a linking aspect, (...) so that (in a sense) even Socrates is a predicate. I argue that, ironically, it is this very feature of a relation instance that undermines Mertz’s entire theory of predication, effectively preventing any connections from being formed between the instances that allegedly compose an ordinary individual such as Socrates. (shrink)

Some properties of Kripke-sheaf semantics for super-intuitionistic predicate logics are shown. The concept ofp-morphisms between Kripke sheaves is introduced. It is shown that if there exists ap-morphism from a Kripke sheaf 1 into 2 then the logic characterized by 1 is contained in the logic characterized by 2. Examples of Kripke-sheaf complete and finitely axiomatizable super-intuitionistic (and intermediate) predicate logics each of which is Kripke-frame incomplete are given. A correction to the author's previous paper Kripke bundles for intermediate (...) predicate logics and Kripke frames for intuitionistic modal logics (Studia Logica, 49(1990), pp. 289–306 ) is stated. (shrink)

In this paper we give a new proof of cut elimination in Gentzen's sequent system for intuitionistic first-order predicate logic. The point of this proof is that the elimination procedure eliminates the cut rule itself, rather than the mix rule.

A partial solution to Ono’s problem P54 is given. Here Ono’s problem P54 is whether Harrop disjunction property is equivalent to disjunction property or not in intermediate predicate logics. As an application of this result it is shown that some intermediate predicate logics satisfy Harrop disjunction property.

We prove that a simple theory of SU-rank 1 is n-ample if and only if the associated theory equipped with a predicate for an independent dense subset is n-ample for n at least 2.

We give a simple proof-theoretic argument showing that Glivenko’s theorem for propositional logic and its version for predicate logic follow as an easy consequence of the deduction theorem, which also proves some Glivenko type theorems relating intermediate predicate logics between intuitionistic and classical logic. We consider two schemata, the double negation shift (DNS) and the one consisting of instances of the principle of excluded middle for sentences (REM). We prove that both schemata combined derive classical logic, while each (...) one of them provides a strictly weaker intermediate logic, and neither of them is derivable from the other. We show that over every intermediate logic there exists a maximal intermediate logic for which Glivenko’s theorem holds. We deduce as well a characterization of DNS, as the weakest (with respect to derivability) scheme that added to REM derives classical logic. (shrink)

LK is much more difficult than NK, and to make matters worse, Gentzen's intention is still unclear when it comes to that system (LK). -/- The second, third, and fourth volumes of the series titled What is LK? conduct the detailed survey of each inference-figure in a toe-to-toe way, as it were, which most mathematicians looked through. -/- The present volume, Vol.4, looks deeper into those operational inference-figures which concerns predicate logic.

are considered with a view toward analyzing operational semantics from the perspective of predicate logic. The notion of a bisimulation is employed in two distinct ways: (i) as an extensional notion of equivalence on programs (or processes) generalizing input/output equivalence (at a cost exceeding II' ,over certain transition predicates computable in log space). and (ii) as a tool for analyzing the dependence of transitions on data (which can be shown to be elementary or nonelementary. depending on the formulation of (...) the transitions). (shrink)