Description Logics (DLs) are a family of well-known terminological knowledge representation formalisms in modern semantics-based systems. This research focuses on analysing how our developed Occurrence Logic (OccL) can conceptually and logically support the development of a description logic. OccL is integrated into the alternative theory of natural language syntax in `Deviational Syntactic Structures' under the label `EFA(X)3' (or the third version of Epi-Formal Analysis in Syntax, EFA(X), which is a radical linguistic theory). From the logical (...) point of view, OccL is a formal logic that mainly deals with the occurrences of symbols as well as with their priorities within linguistic descriptions, i.e. natural language syntax, semantics and phonology. In this article---based on our OccL-based definitions of the concepts of `strong implication' and `occurrence value' as well as of the logical concept `identical occurrence constructor (IDOC)' that is the most fundamental logical concept in our formalism---we will model Occurrence Description Logic ($\mathcal{ODL}$). Accordingly, we will formally-logically analyse `occurrence(s) of symbol(s)' within descriptions of the world in $\mathcal{ODL}$. In addition, we will analyse and assess the logical concepts of `occurrence' and `occurrence priority' in $\mathcal{ODL}$. This research can make a strong logical background for our future research in the development of a Modal Occurrence Description Logic. (shrink)

We propose a nonmonotonic Description Logic of typicality able to account for the phenomenon of the combination of prototypical concepts. The proposed logic relies on the logic of typicality ALC + TR, whose semantics is based on the notion of rational closure, as well as on the distributed semantics of probabilistic Description Logics, and is equipped with a cognitive heuristic used by humans for concept composition. We first extend the logic of typicality ALC + (...) TR by typicality inclusions of the form p :: T(C) v D, whose intuitive meaning is that “we believe with degree p about the fact that typical Cs are Ds”. As in the distributed semantics, we define different scenarios containing only some typicality inclusions, each one having a suitable probability. We then exploit such scenarios in order to ascribe typical properties to a concept C obtained as the combination of two prototypical concepts. We also show that reasoning in the proposed Description Logic is EXPTIME-complete as for the underlying standard Description Logic ALC. (shrink)

We propose a nonmonotonic Description Logic of typicality able to account for the phenomenon of combining prototypical concepts, an open problem in the fields of AI and cognitive modelling. Our logic extends the logic of typicality ALC + TR, based on the notion of rational closure, by inclusions p :: T(C) v D (“we have probability p that typical Cs are Ds”), coming from the distributed semantics of probabilistic Description Logics. Additionally, it embeds a set (...) of cognitive heuristics for concept combination. We show that the complexity of reasoning in our logic is EXPTIME-complete as in ALC. (shrink)

Logical analysis of the applicability of nominals (which are introduced by hybrid logic) in the formal descriptions of the world (within modern knowledge representation and semantics-based systems) is very important because nominals, as second sorts of propositional symbols, can support logical identification of the described world at specific [temporal and/or spacial] states. This paper will focus on answering the philosophical-logical question of ‘how a fundamental world description in description logic (DL) and a nominal can be related (...) to each other?’. Based on my assumption that nominals can support more adequate identification of the world in DL, this paper will deal with the concept of ‘world identification’. Accordingly, based on a logical-terminological analysis of nominals, the paper will analyse hybridised fundamental world descriptions. The research will finally reach the idea that we can have a hybrid description logic based on the analysed concepts. (shrink)

Ontology is currently perceived as the solution of first resort for all problems related to biomedical terminology, and the use of description logics is seen as a minimal requirement on adequate ontology-based systems. Contrary to common conceptions, however, description logics alone are not able to prevent incorrect representations; this is because they do not come with a theory indicating what is computed by using them, just as classical arithmetic does not tell us anything about the entities that are (...) added or subtracted. In this paper we shall show that ontology is indeed an essential part of any solution to the problems of medical terminology – but only if it is understood in the right sort of way. Ontological engineering, we shall argue, should in every case go hand in hand with a sound ontological theory. (shrink)

We intoduce a novel extension of Description Logics (DLs) of typicality by means of probabilities able to represent and reason about typical properties and defeasible inheritance in DLs.

We introduce a framework that allows for the construction of sequent systems for expressive description logics extending ALC. Our framework not only covers a wide array of common description logics, but also allows for sequent systems to be obtained for extensions of description logics with special formulae that we call "role relational axioms." All sequent systems are sound, complete, and possess favorable properties such as height-preserving admissibility of common structural rules and height-preserving invertibility of rules.

Formalisms based on one or other flavor of Description Logic (DL) are sometimes put forward as helping to ensure that terminologies and controlled vocabularies comply with sound ontological principles. The objective of this paper is to study the degree to which one DL-based biomedical terminology (SNOMED CT) does indeed comply with such principles. We defined seven ontological principles (for example: each class must have at least one parent, each class must differ from its parent) and examined the properties (...) of SNOMED CT classes with respect to these principles. Our major results are: 31% of these classes have a single child; 27% have multiple parents; 51% do not exhibit any differentiae between the description of the parent and that of the child. The applications of this study to quality assurance for ontologies are discussed and suggestions are made for dealing with the phenomenon of multiple inheritance. The advantages and limitations of our approach are also discussed. (shrink)

Formalizing Euclid’s first axiom. Bulletin of Symbolic Logic. 20 (2014) 404–5. (Coauthor: Daniel Novotný) -/- Euclid [fl. 300 BCE] divides his basic principles into what came to be called ‘postulates’ and ‘axioms’—two words that are synonyms today but which are commonly used to translate Greek words meant by Euclid as contrasting terms. -/- Euclid’s postulates are specifically geometric: they concern geometric magnitudes, shapes, figures, etc.—nothing else. The first: “to draw a line from any point to any point”; the last: (...) the parallel postulate. -/- Euclid’s axioms are general principles of magnitude: they concern geometric magnitudes and magnitudes of other kinds as well even numbers. The first is often translated “Things that equal the same thing equal one another”. -/- There are other differences that are or might become important. -/- Aristotle [fl. 350 BCE] meticulously separated his basic principles [archai, singular archê] according to subject matter: geometrical, arithmetic, astronomical, etc. However, he made no distinction that can be assimilated to Euclid’s postulate/axiom distinction. -/- Today we divide basic principles into non-logical [topic-specific] and logical [topic-neutral] but this too is not the same as Euclid’s. In this regard it is important to be cognizant of the difference between equality and identity—a distinction often crudely ignored by modern logicians. Tarski is a rare exception. The four angles of a rectangle are equal to—not identical to—one another; the size of one angle of a rectangle is identical to the size of any other of its angles. No two angles are identical to each other. -/- The sentence ‘Things that equal the same thing equal one another’ contains no occurrence of the word ‘magnitude’. This paper considers the problem of formalizing the proposition Euclid intended as a principle of magnitudes while being faithful to the logical form and to its information content. (shrink)

In his article, ‘What's Wrong with Tooley's Argument from Evil?’, Calum Miller's goal was to show that the evidential argument from evil that I have advanced is unsound, and in support of that claim, Miller set out three main objections. First, he argued that I had failed to recognize that the actual occurrence of an event can by itself, at least in principle, constitute good evidence that it was not morally wrong for God to allow events of the kind (...) in question. Miller's second objection was then that, in attempting to show that it is unlikely that God exists, I had failed to consider either positive arguments in support of the existence of God or possible theodicies, and thus that I was unjustified in drawing any conclusions concerning the probability that theism is true in the light of the total evidence available. Miller's third and final objection was that one of the approaches to logical probability that I employed – namely, that based upon a structure-description equiprobability principle, rather than a state-description equiprobability principle – was unsound since it has clearly unacceptable implications. In response, I argue that all three of Miller's objections are unsound. The third objection, however, is nevertheless important since it shows that my type of argument from evil cannot be based merely on the evils found in the world. One must also consider good states of affairs, and their relations to bad ones. I show, however, that that deficiency can be addressed in a completely satisfactory manner. (shrink)

This paper presents rules of inference for a binary quantifier I for the formalisation of sentences containing definite descriptions within intuitionist positive free logic. I binds one variable and forms a formula from two formulas. Ix[F, G] means ‘The F is G’. The system is shown to have desirable proof-theoretic properties: it is proved that deductions in it can be brought into normal form. The discussion is rounded up by comparisons between the approach to the formalisation of definite descriptions (...) recommended here and the more usual approach that uses a term-forming operator ι, where ιxF means ‘the F’. (shrink)

In computational complexity theory, decision problems are divided into complexity classes based on the amount of computational resources it takes for algorithms to solve them. In theoretical computer science, it is commonly accepted that only functions for solving problems in the complexity class P, solvable by a deterministic Turing machine in polynomial time, are considered to be tractable. In cognitive science and philosophy, this tractability result has been used to argue that only functions in P can feasibly work as computational (...) models of human cognitive capacities. One interesting area of computational complexity theory is descriptive complexity, which connects the expressive strength of systems of logic with the computational complexity classes. In descriptive complexity theory, it is established that only first-order systems are connected to P, or one of its subclasses. Consequently, second-order systems of logic are considered to be computationally intractable, and may therefore seem to be unfit to model human cognitive capacities. This would be problematic when we think of the role of logic as the foundations of mathematics. In order to express many important mathematical concepts and systematically prove theorems involving them, we need to have a system of logic stronger than classical first-order logic. But if such a system is considered to be intractable, it means that the logical foundation of mathematics can be prohibitively complex for human cognition. In this paper I will argue, however, that this problem is the result of an unjustified direct use of computational complexity classes in cognitive modelling. Placing my account in the recent literature on the topic, I argue that the problem can be solved by considering computational complexity for humanly relevant problem solving algorithms and input sizes. (shrink)

Sentences containing definite descriptions, expressions of the form ‘The F’, can be formalised using a binary quantifier ι 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 intuitionist negative free logic extended by such a quantifier, which was presented (...) in (Kürbis 2019), INFι is first compared to a system of Tennant’s and an axiomatic treatment of a term forming ι operator within intuitionist negative free logic. Both systems are shown to be equivalent to the subsystem of INFι in which the G of ιx[F, G] is restricted to identity. INFι is then compared to an intuitionist version of a system of Lambert’s which in addition to the term forming operator has an operator for predicate abstraction for indicating scope distinctions. The two systems will be shown to be equivalent through a translation between their respective languages. Advantages of the present approach over the alternatives are indicated in the discussion. (shrink)

We study a new formal logic LD introduced by Prof. Grzegorczyk. The logic is based on so-called descriptive equivalence, corresponding to the idea of shared meaning rather than shared truth value. We construct a semantics for LD based on a new type of algebras and prove its soundness and completeness. We further show several examples of classical laws that hold for LD as well as laws that fail. Finally, we list a number of open problems. -/- .

Husserl and Frege on the analysis of the concept of number and primitive logical concepts.

This paper presents a way of formalising definite descriptions with a binary quantifier ι, where ιx[F, G] is read as ‘The F is G’. Introduction and elimination rules for ι in a system of intuitionist negative free logic are formulated. Procedures for removing maximal formulas of the form ιx[F, G] are given, and it is shown that deductions in the system can be brought into normal form.

We present some ideas on logical process descriptions, using relations from the DIO (Drug Interaction Ontology) as examples and explaining how these relations can be naturally decomposed in terms of more basic structured logical process descriptions using terms from linear logic. In our view, the process descriptions are able to clarify the usual relational descriptions of DIO. In particular, we discuss the use of logical process descriptions in proving linear logical theorems. Among the types of reasoning supported by DIO (...) one can distinguish both (1) basic reasoning about general structures in reality and (2) the domain-specific reasoning of experts. We here propose a clarification of this important distinction between (realist) reasoning on the basis of an ontology and rule-based inferences on the basis of an expert’s view. (shrink)

This paper presents rules in sequent calculus for a binary quantifier I to formalise definite descriptions: Ix[F, G] means ‘The F is G’. The rules are suitable to be added to a system of positive free logic. The paper extends the proof of a cut elimination theorem for this system by Indrzejczak by proving the cases for the rules of I. There are also brief comparisons of the present approach to the more common one that formalises definite descriptions with (...) a term forming operator. In the final section rules for I for negative free and classical logic are also mentioned. (shrink)

In this work we present NERVOUS, an intelligent recommender system exploiting a probabilistic extension of a Description Logic of typicality to dynamically generate novel contents in AllMusic, a comprehensive and in-depth resource about music, providing data about albums, bands, musicians and songs. The tool can be used for both the generation of novel music genres and styles, described by a set of typical properties characterizing them, and the reclassification of the available songs within such new genres.

Corcoran, John. 2005. Meanings of word: type-occurrence-token. Bulletin of Symbolic Logic 11(2005) 117. -/- Once we are aware of the various senses of ‘word’, we realize that self-referential statements use ambiguous sentences. If a statement is made using the sentence ‘this is a pronoun’, is the speaker referring to an interpreted string, a string-type, a string-occurrence, a string-token, or what? The listeners can wonder “this what?”. -/- John Corcoran, Meanings of word: type-occurrence-token Philosophy, University at Buffalo, (...) Buffalo, NY 14260-4150 E-mail: [email protected] The four-letter written-English expression ‘word’, which plays important roles in applications and expositions of logic and philosophy of logic, is ambiguous (multisense, or polysemic) in that it has multiple normal meanings (senses, or definitions). Several of its meanings are vague (imprecise, or indefinite) in that they admit of borderline (marginal, or fringe) cases. This paper juxtaposes, distinguishes, and analyses several senses of ‘word’ focusing on a constellation of senses analogous to constellations of senses of other expression words such as ‘expression’, ‘symbol’, ‘character’, ‘letter’, ‘term’, ‘phrase’, ‘formula’, ‘sentence’, ‘derivation’, ‘paragraph’, and ‘discourse’. Consider, e.g., the word ‘letter’. In one sense there are exactly twenty-six letters (letter-types or ideal letters) in the English alphabet and there are exactly four letters in the word ‘letter’. In another sense, there are exactly six letters (letter-repetitions or letter-occurrences) in the word-type ‘letter’. In yet another sense, every new inscription (act of writing or printing) of ‘letter’ brings into existence six new letters (letter-tokens or ink-letters) and one new word that had not previously existed. The number of letter-occurrences (occurrences of a letter-type) in a given word-type is the same as the number of letter-tokens (tokens of a letter-type) in a single token of the given word. Many logicians fail to distinguish “token” from “occurrence” and a few actually confuse the two concepts. Epistemological and ontological problems concerning word-types, word-occurrences, and word-tokens are described in philosophically neutral terms. This paper presents a theoretical framework of concepts and principles concerning logicography, including use of English in logic. The framework is applied to analytical exposition and critical evaluation of classic passages in the works of philosophers and logicians including Boole, Peirce, Frege, Russell, Tarski, Church and Quine. This paper is intended as a philosophical sequel to Corcoran et al. “String Theory”, Journal of Symbolic Logic 39(1974) 625-637. https://www.academia.edu/s/cdfa6c854e?source=link -/- . (shrink)

We present an algorithm for concept combination inspired and informed by the research in cognitive and experimental psychology. Dealing with concept combination requires, from a symbolic AI perspective, to cope with competitive needs: the need for compositionality and the need to account for typicality effects. Building on our previous work on weighted logic, the proposed algorithm can be seen as a step towards the management of both these needs. More precisely, following a proposal of Hampton [1], it combines two (...) weighted Description Logic formulas, each defining a concept, using the following general strategy. First it selects all the features needed for the combination, based on the logical distinc- tion between necessary and impossible features. Second, it determines the threshold and assigns new weights to the features of the combined concept trying to preserve the relevance and the necessity of the features. We illustrate how the algorithm works exploiting some paradigmatic examples discussed in the cognitive literature. (shrink)

Although formal thought disorder (FTD) has been for long a clinical label in the assessment of some psychiatric disorders, in particular of schizophrenia, it remains a source of controversy, mostly because it is hard to say what exactly the “formal” in FTD refers to. We see anomalous processing of terminological knowledge, a core construct of human knowledge in general, behind FTD symptoms and we approach this anomaly from a strictly formal perspective. More specifically, we present here a symbolic computational model (...) of storage in, and activation of, a human semantic network, or semantic memory, whose core element is logical form; this is normalized by description logic (DL), namely by CL, a DL-based language – Conception Language – designed to formalize conceptualization from the viewpoint of individual cognitive agency. In this model, disruptions in the rule-based implementation of the logical form account for the apparently semantic anomalies symptomatic of FTD, which are detected by means of a CL-based algorithmic assessment. (shrink)

In this paper, by suggesting a formal representation of science based on recent advances in logic-based Artificial Intelligence (AI), we show how three serious concerns around the realisation of traditional scientific realism (the theory/observation distinction, over-determination of theories by data, and theory revision) can be overcome such that traditional realism is given a new guise as ‘naturalised’. We contend that such issues can be dealt with (in the context of scientific realism) by developing a formal representation of science based (...) on the application of the following tools from Knowledge Representation: the family of Description Logics, an enrichment of classical logics via defeasible statements, and an application of the preferential interpretation of the approach to Belief Revision. (shrink)

In this study, I intend to show how and why, in the Port-Royal Logic, a singular term can reveal the nature of the logical judgment in the handbook. As I argue, the treatment given to one of thee singular terms, namely, the defined descriptions, in the terminology introduced by Russell, leads to an opening to langage that sounds unexpected and unjustified. Considering the privilege of thinking over langage and also that judgment is the mental act that defines logic, (...) however, we may understand how the authors regard langage, in relation to the epistemic constituents, namely, the mental acts within the terms. In doing so we are compelled to recognize the implications of this step towards pragmatism in fixing the meaning of defined descriptions to the nature of judgment in the handbook. This opening to langage reveals the conception of judgment as a twofold mental act: a formal and a practical (moral and theological) one. (shrink)

In Pietroski ( 2018 ) a simple representation language called SMPL is introduced, construed as a hypothesis about core conceptual structure. The present work is a study of this system from a logical perspective. In addition to establishing a completeness result and a complexity characterization for reasoning in the system, we also pinpoint its expressive limits, in particular showing that the fourth corner in the square of opposition (“ Some_not ”) eludes expression. We then study a seemingly small extension, called (...) SMPL +, which allows for a minimal predicate-binding operator. Perhaps surprisingly, the resulting system is shown to encode precisely the concepts expressible in first-order logic. However, unlike the latter class, the class of SMPL + expressions admits a simple procedural (context-free) characterization. Our contribution brings together research strands in logic—including natural logic, modal logic, description logic, and hybrid logic—with recent advances in semantics and philosophy of language. (shrink)

The first aim of this paper is to elucidate Russell’s construction of spatial points, which is to be <br>considered as a paradigmatic case of the "logical constructions" that played a central role in his epistemology and theory of science. Comparing it with parallel endeavours carried out by Carnap and Stone it is argued that Russell’s construction is best understood as a structural representation. It is shown that Russell’s and Carnap’s representational constructions may be considered as incomplete and sketchy harbingers of (...) Stone’s representation theorems. The representational program inaugurated by Stone’s theorems was one of the success stories of 20th century’s mathematics. This suggests that representational constructions à la Stone could also be important for epistemology and philosophy of science. More specifically it is argued that the issues proposed by Russellian definite descriptions, logical constructions, and structural representations still have a place on the agenda of contemporary epistemology and philosophy of science. Finally, the representational interpretation of Russell’s logical constructivism is used to shed some new light on the recently vigorously discussed topic of his structural realism. (shrink)

In this article, I use Edmund Gettier’s Ten Coins hypothetical scenario to illustrate some reasoning errors in the use of definite descriptions. The Gettier problem, central as it is to modern epistemology, is first and foremost an argument, which Gettier (Analysis 23(6):121–123, 1963) constructs to prove a contrary conclusion to a widely held view in epistemology. Whereas the epistemological claims in the case have been extensively analysed conceptually, the strategies and tools from other philosophical disciplines such as analytic philosophy of (...) language, logic and argumentation that Gettier deploys in the case have scarcely received any attention. This work abstracts from the epistemological content and examines Gettier’s handling of the definite description involved, and how that affects the cogency of his argument. (shrink)

Although Strawson’s main aim in “On Referring” was to argue that definite descriptions can be used referentially – that is, “to mention or refer to some individual person or single object . . . , in the course of doing what we should normally describe as making a statement about that person [or] object” (1950, p. 320) – he denied that definite descriptions are always used referentially. The description in ‘Napoleon was the greatest French soldier’ is not used referentially, (...) says Strawson, since it is used not to mention an individual, but only “to say something about an individual already mentioned” (p. 320). This is an example of what we may call a predicative use of a definite description, though such uses might be better illustrated by considering the false sentence.. (shrink)

In his new book, Logical Form, Andrea Iacona distinguishes between two different roles that have been ascribed to the notion of logical form: the logical role and the semantic role. These two roles entail a bifurcation of the notion of logical form. Both notions of logical form, according to Iacona, are descriptive, having to do with different features of natural language sentences. I agree that the notion of logical form bifurcates, but not that the logical role is merely descriptive. In (...) this paper, I focus on formalization, a process by which logical form, on its logical role, is attributed to natural language sentences. According to some, formalization is a form of explication, and it involves normative, pragmatic, as well as creative aspects. I present a view by which formalization involves explicit commitments on behalf of a reasoner or an interpreter, which serve the normative grounds for the evaluation of a given text. In previous work, I proposed the framework of semantic constraints for the explication of logical consequence. Here, I extend the framework to include formalization constraints. The various constraints then serve the role of commitments. I discuss specific issues raised by Iacona concerning univocality, co-reference and equivocation, and I show how our views on these matters diverge as a result of our different starting assumptions. (shrink)

Traditionally, consistency is the only criterion for the quality of a theory in logic-based approaches to reasoning about actions. This work goes beyond that and contributes to the meta-theory of actions by investigating what other properties a good domain de- scription should satisfy. Having Propositional Dynamic Logic (PDL) as background, we state some meta-theoretical postulates concerning this sore spot. When all pos- tulates are satisfied, we call the action theory modular. We point out the problems that arise when (...) the postulates about modularity are violated, and propose algorith- mic checks that can help the designer of an action theory to overcome them. Besides being easier to understand and more elaboration tolerant in McCarthy’s sense, mod- ular theories have interesting computational properties. Moreover, we also propose a framework for updating domain descriptions and show the importance modularity has in action theory change. (shrink)

This paper uses classical logic for a simultaneous description of the syntax and semantics of a fragment of English and it is argued that such an approach to natural language allows procedural aspects of linguistic theory to get a purely declarative formulation. In particular, it will be shown how certain construction rules in Discourse Representation Theory, such as the rule that indefinites create new discourse referents and definites pick up an existing referent, can be formulated declaratively if (...) class='Hi'>logic is used as a metalanguage for English. In this case the declarative aspects of a rule are highlighted when we focus on the model theory of the description language while a procedural perspective is obtained when its proof theory is concentrated on. Themes of interest are Discourse Representation Theory, resolution of anaphora, resolution of presuppositions, and underspecification. (shrink)

This original research hypothesises that the most fundamental building blocks of logical descriptions of cognitive, or knowledge, agents’ descriptions are expressible based on their conceptions (of the world). This article conceptually and logically analyses agents’ conceptions in order to offer a constructivist- based logical model for terminological knowledge. The most significant characteristic of [terminological] knowing is that there are strong interrelationships between terminological knowledge and the individualistic constructed, and to-be-constructed, models of knowledge. Correspondingly, I conceptually and logically analyse conception expressions (...) based on terminological knowledge, and I show how terminological knowledge may reasonably be assumed to be constructed based on the agents’ conceptions of the world. The focus of my model is on terminological knowledge structures, which may find applications in such diverse fields as the Semantic Web and educational/learning systems. (shrink)

An attractive way to model the relation between an underspecified syntactic representation and its completions is to let the underspecified representation correspond to a logical description and the completions to the models of that description. This approach, which underlies the Description Theory of Marcus et al. 1983 has been integrated in Vijay-Shanker 1992 with a pure unification approach to Lexicalized Tree-Adjoining Grammars (Joshi et al. 1975, Schabes 1990). We generalize Description Theory by integrating semantic information, that (...) is, we propose to tackle both syntactic and semantic underspecification using descriptions. (shrink)

I argue that we can and should extend Tarski's model-theoretic criterion of logicality to cover indefinite expressions like Hilbert's ɛ operator, Russell's indefinite description operator η, and abstraction operators like 'the number of'. I draw on this extension to discuss the logical status of both abstraction operators and abstraction principles.

Contemporary semantic description of logic is based on the ontology of all possible interpretations, an insufficiently clear metaphysical concept. In this article, logic is described as the internal organization of language. Logical concepts -- logical constants, logical truths, and logical consequence -- are defined using the internal syntactic and semantic structure of language. For a first-order language, it has been shown that its logical constants are connectives and a certain type of quantifiers for which the universal and (...) existential quantifiers form a functionally complete set of quantifiers. Neither equality nor cardinal quantifiers belong to the logical constants of a first-order language. (shrink)

Description Logics are nowadays widely accepted as formalisms which provide reasoning facilities which allow us to discover inconsistencies in ontologies in an automatic fashion. Where ontologies are developed in modular fashion, they allow changes in one module to propogated through the system of ontologies automatically in a way which helps to maintain consistency and stability. For this feature to be utilized effectively, however, requires that domain ontologies be represented in a normalized form.

This paper has a dual character, combining a philosophical ontological exploration with a conceptual modeling approach in systems and software engineering. Such duality is already practiced in software engineering, in which the current dominant modeling thesis is object orientation. This work embraces an anti-thesis that centers solely on the process rather than emphasizing the object. The approach is called occurrence-only modeling, in which an occurrence means an event or process where a process is defined as an orchestrated net (...) of events that form a semantical whole. In contrast to object orientation, in this occurrence-only modeling objects are nothing more than long events. We apply this paradigm to (1) a UML/BPMN inventory system in simulation engineering and (2) an event-based system that represents medical occurrences that occur on a timeline. The aim of such a venture is to enhance the field of conceptual modeling by adding yet a new alternative methodology and clarifying differences among approaches. Conceptual modeling’s importance has been recognized in many research areas. An active research community in simulation engineering demonstrates the growing interest in conceptual modeling. In the clinical domains, temporal information elucidates the occurrence of medical events (e.g., visits, laboratory tests). These applications give an opportunity to propose a new approach that includes (a) a Stoic ontology that has two types of being, existence and subsistence; (b) Thinging machines that limit activities to five generic actions; and (c) Lupascian logic, which handles negative events. With such a study, we aim to substantiate the assertion that the “occurrence only” approach is a genuine philosophical base for conceptual modeling. The results in this paper seem to support such a claim. (shrink)

In the view of my philosophical position “nominal conceptualism”, cognitive/knowledge agents, who are in some way aware of expressing the world based on their mental concepts, deal with their linguistic and/or symbolic expressions. In this paper I rely on nominal conceptualism to logically characterise agents’ concept-based descriptions of the world and analyse a fundamental logical system for conception representation.

Carnap's theory of descriptions was restricted in two ways. First, the descriptive conditions had to be non-modal. Second, only primitive predicates or the identity predicate could be used to predicate something of the descriptum . The motivating reasons for these two restrictions that can be found in the literature will be critically discussed. Both restrictions can be relaxed, but Carnap's theory can still be blamed for not dealing adequately with improper descriptions.

The paper compares two theories of the nature of logic: Penelope Maddy's and my own. The two theories share a significant element: they both view logic as grounded not just in the mind (language, concepts, conventions, etc.), but also, and crucially, in the world. But the two theories differ in significant ways as well. Most distinctly, one is an anti-holist, "austere naturalist" theory while the other is a non-naturalist "foundational-holistic" theory. This methodological difference affects their questions, goals, orientations, (...) the scope of their investigations, their logical realism (the way they ground logic in the world), their explanation of the modal force of logic, and their approach to the relation between logic and mathematics. The paper is not polemic. One of its goal is a perspicuous description and analysis of the two theories, explaining their differences as well as commonalities. Another goal is showing that and how (i) a grounding of logic is possible, (ii) logical realism can be arrived at from different perspectives and using different methodologies, and (iii) grounding logic in the world is compatible with a central role for the human mind in logic. (shrink)

Logics based on weak Kleene algebra (WKA) and related structures have been recently proposed as a tool for reasoning about flaws in computer programs. The key element of this proposal is the presence, in WKA and related structures, of a non-classical truth-value that is “contaminating” in the sense that whenever the value is assigned to a formula ϕ, any complex formula in which ϕ appears is assigned that value as well. Under such interpretations, the contaminating states represent occurrences of a (...) flaw. However, since different programs and machines can interact with (or be nested into) one another, we need to account for different kind of errors, and this calls for an evaluation of systems with multiple contaminating values. In this paper, we make steps toward these evaluation systems by considering two logics, HYB1 and HYB2, whose semantic interpretations account for two contaminating values beside classical values 0 and 1. In particular, we provide two main formal contributions. First, we give a characterization of their relations of (multiple-conclusion) logical consequence—that is, necessary and sufficient conditions for a set Δ of formulas to logically follow from a set Γ of formulas in HYB1 or HYB2 . Second, we provide sound and complete sequent calculi for the two logics. (shrink)

What is the relationship between the world and logic, between intuition and language, between objects and their quantitative determinations? Rationalists, on the one hand, hold that the world is structured in a rational way. Representationalists, on the other hand, assume that language, logic, and mathematics are only the means to order and describe the intuitively given world. In World and Logic, Jens Lemanski takes up three surprising arguments from Arthur Schopenhauer’s hitherto undiscovered Berlin Lectures, which concern the (...) philosophy of language, logic, and mathematics. Based on these arguments, Lemanski develops a new position entitled ‘rational representationalism’: the world is always structured by human beings according to linguistic, logical, and mathematical principles, but the basic vocabulary of these structural descriptions already contains metaphors taken from the world around us. (shrink)

Physicalistic theories of psychology are a classic case of scientific imperialism: the explanatory capacity of physics, both with respect to its methods and to its domain, is taken to extend beyond the traditional realm of physics, and into that of psychology. I argue in this paper that this particular imperialistic venture has failed. Contemporary psychology uses methods not modelled on those of physics, embracing first-personal methodology where physics is strictly impersonal. I make the case that whether or not scientific imperialism (...) is in general harmful, in this instance naturalists who reject first philosophy should give up physicalist imperialism. Using only general principles from the philosophy of logic plus accepted physicalist criteria of identity, I show that first-personal psychology embodies a minor but fruitful increase in expressive strength compared to impersonal psychology: the ability to distinguish descriptively indiscriminable posits. (shrink)

This paper presents a sequent calculus and a dual domain semantics for a theory of definite descriptions in which these expressions are formalised in the context of complete sentences by a binary quantifier I. I forms a formula from two formulas. Ix[F, G] means ‘The F is G’. This approach has the advantage of incorporating scope distinctions directly into the notation. Cut elimination is proved for a system of classical positive free logic with I and it is shown to (...) be sound and complete for the semantics. The system has a number of novel features and is briefly compared to the usual approach of formalising ‘the F ’ by a term forming operator. It does not coincide with Hintikka’s and Lambert’s preferred theories, but the divergence is well-motivated and attractive. (shrink)

Due to their acceptance of the verifiability principle, the only way left for logical positivists to argue for the meaningfulness of religious language was to accept some sort of emotivistic conception of it or to reduce it to the description of religious attitude. The verifiability principle, however, suffers from some severe limitations that make it inadequate as a criterion for cognitive meaning. To resolve these problems, logical positivists gave up the requirement of conclusive verifiability and defended a sort of (...) ‘liberalization’ of the verifiability principle. Carnap’s confirmability criterion for cognitive meaning, which is a liberalized form of the verifiability principle, is compatible with an orthodox conception of religious language since, from a theistic perspective, the existence of God can be confirmed through our observational statements. (shrink)

This paper explores the question of what logic is not. It argues against the wide spread assumptions that logic is: a model of reason; a model of correct reason; the laws of thought, or indeed is related to reason at all such that the essential nature of the two are crucially or essentially co-illustrative. I note that due to such assumptions, our current understanding of the nature of logic itself is thoroughly entangled with the nature of reason. (...) I show that most arguments for the presence of any sort of essential re- lationship between logic and reason face intractable problems and demands, and fall well short of addressing them. These arguments include those for the notion that logic is normative for reason (or that logic and correct reason are in some way the same thing), that logic is some sort of description of correct reason and that logic is an abstracted or idealised version of correct reason. A strong version of logical realism is put forward as an alternative view, and is briefly explored. (shrink)

The notion of logical construction was used by Bertrand Russell in the early 20th century, which originally comes from A. N. Whitehead. Russell said that matter as a mind-independent thing can only be known by description. He also argued that matter is a logical construction of sense-data. However, this leads to an incoherent view of the direct or indirect connection between a mind and the external world. The problem examining is whether a collapsing house is a logical construction of (...) the sense-data of rumbling sounds and collapsing shapes. Using Russell's writings between 1911 and 1918, I will analyze how Russell characterized logical constructions. Finally, I will show Russell’s view about the relation of logical constructions to matter and sense-data. A careful interpretation of Russell's thoughts shows that the contents of the statements of the physical world are not constructions being equivalent to the contents of the sense-datum statements. (shrink)

This paper and its sequel “look under the hood” of the usual sorts of proof-theoretic systems for certain well-known intuitionistic and classical propositional modal logics. Section 1 is preliminary. Of most importance: a marked formula will be the result of prefixing a formula in a propositional modal language with a step-marker, for this paper either 0 or 1. Think of 1 as indicating the taking of “one step away from 0.” Deductions will be constructed using marked formulas. Section 2 presents (...) the model-theoretic concepts, based on those in [7], that guide the rest of this paper. Section 3 presents Natural Deduction systems IK and CK, formalizations of intuitionistic and classical one-step versions of K. In these systems, occurrences of step-markers allow deductions to display deductive structure that is covered over in familiar “no step” proof-theoretic systems for such logics. Box and Diamond are governed by Introduction and Elimination rules; the familiar K rule and Necessitation are derived (i.e. admissible) rules. CK will be the result of adding the 0-version of the Rule of Excluded Middle to the rules which generate IK. Note: IK is the result of merely dropping that rule from those generating CK, without addition of further rules or axioms (as was needed in [7]). These proof-theoretic systems yield intuitionistic and classical consequence relations by the obvious definition. Section 4 provides some examples of what can be deduced in IK. Section 5 defines some proof-theoretic concepts that are used in Section 6 to prove the soundness of the consequence relation for IK (relative to the class of models defined in Section 2.) Section 7 proves its completeness (relative to that class). Section 8 extends these results to the consequence relation for CK. (Looking ahead: Part 2 will investigate one-step proof-theoretic systems formalizing intuitionistic and classical one-step versions of some familiar logics stronger than K.). (shrink)

I argue against the claim -- advocated by Albert Einstein, Bernard Williams, and Ted Sider, among others -- that a description is objective only if it says how the world is in itself. Instead, I argue for the claim -- inspired by comments of Niels Bohr -- that a family of descriptions is objective only if they co-vary with their respective descriptive contexts. Moreover, I claim that "there is a shared objective reality" simply means that it is possible to (...) satisfy this kind of covariance requirement. (shrink)

It’s widely accepted that normativity is not subject to truth values. The underlying reasoning is that truth values can only be predicated of descriptive statements; normative statements are prescriptive, not descriptive; thus truth value predicates cannot be assigned to normative statements. Hence, deonticity lacks logical semantics. This semantic monism has been challenged over the last decades from a series of perspectives that open the way for legal logics with imperative semantics. In the present paper I will go back to Kant (...) and review his understanding of practical judgments, presenting it as supported by a pluralistic semantics. From this perspective a norm of Law is a logical expression that includes as content a generic description of a possible behavior by a generality of juridical agents, and assigns to that content the assertion of its obligatory character, accompanied by a disincentive for non-compliance. From this perspective legal norms can be syntactically formalized and assigned appropriate semantic values in such terms that they can be incorporated into valid inferential schemes. The consequence is that we can put together legal logics that handle both the phenomenal and the deontic dimensions of legality. (shrink)