Nonclassical Logics

Carnap (1943) noted that categoricity fails even for propositional logic. He observed that some “non-normal” models exist for classical logical consequence. The immediate reaction to this phenomenon was to strengthen the formal machinery or impose semantical constraints to rule out nonnormal models, and as a result, their very structure was largely overlooked. In this paper, I examine these non-normal models and explore the possibility that they assign non-classical meanings to logical connectives. By relaxing some standards regarding semantics, we will see (...) that these models, in some sense, embed a non-deterministic matrix (Nmatrix) with interesting similarity to the strong Kleene’s 3-valued matrix. Then, I briefly explore its induced logics: two non-compositional counterparts of the well-known logics LP and K3. (shrink)

This paper discusses the possible classification of Aristotle’s syllogistic as a non-classical logical system, positing Aristotle himself as a non-classical logician. Initially, we find compelling arguments for this thesis, particularly regarding the expressive power and the rules governing logical inference inherent in Aristotle’s approach. My analysis nevertheless addresses two significant counterarguments. The first, the special case objection, posits that Aristotle’s syllogistic can be framed as a classical logic which deals with canonical syllogistic forms. I argue that this objection is insufficient, (...) as it is possible to point cases in which his system seems to differ from classical logic. The second counterargument, the formalisation gap objection, highlights that Aristotle’s syllogistic resists straightforward modern logical interpretations. This latter objection is evaluated as more compelling and substantial. In particular, a distinction between two concepts is proposed which could help us understand what Aristotle was aiming at in his theory of inference: the notions of ‘to follow from’ and ‘to be a conclusion of’. While the former aligns with the usual sense formal validity, the second requires an inferential structure connecting the premises to the conclusion, explaining why Aristotle excluded inferences like from A ⊢ A syllogisms despite acknowledging that A follows from A. (shrink)

According to dialectical disposition expressivism about conjunction, disjunction, and negation, the function of these connectives is to convey dispositions speakers have with respect to challenging and meeting challenges to assertions. This paper investigates the view’s implications for logic. An interpretation in terms of dialectical dispositions is proposed for the proof rules of a bilateral sequent system. Rules that are sound with respect to this interpretation can be seen as generating an intrinsic logic of dialectical dispo- sition expressivism. It is argued (...) that such a logic will be very weak —weaker than the intersection of minimal logic and FDE. (shrink)

In recent years, there has been a growing interest in truthmaker semantics as a framework for understanding a range of phenomena in philosophy and linguistics. Despite this interest, there has been limited study of the various logics that arise from the semantics. This paper aims to address this gap by exploring numerous ‘truthmaker logics’ and proving their compactness and decidability. This is in continuation with the inquiry of Fine and Jago (2019), who proved compactness and decidability for a particular kind (...) of truthmaker logic. The key results going into this are (1) ‘standard translations’ into first-order logic; (2) a truthmaker analogue of the finite model property; and (3) a proof showing that truthmaker consequence on semilattices coincides with truthmaker consequence on complete lattices. Finally, the connection with modal logic is examined. Specifically, it is illustrated how endowing truthmaker semantics with classical negation results in modal information logics. (shrink)

The present paper investigates whether strictly classical inferences contribute to the formalization of (genuine) paradoxes within natural deduction. Tennant's criterion for paradoxicality relies on the generation of an infinite reduction sequence, which distinguishes genuine paradoxes from mere inconsistencies. His methodological conjecture posits that genuine paradoxes are never strictly classical and can be derived without classical inferences such as the Law of Excluded Middle, Dilemma, Classical Reductio, and Double Negation Elimination. -/- It appears that there were two reasons for Tennant's proposal (...) of the methodological conjecture. The one is that strictly classical inferences hinder the generation of an infinite reduction sequence and the other is that strictly classical inferences have no role in the formalization of genuine paradoxes. -/- This paper raises questions about these two reasons. Focusing on the liar paradox, it will be argued that strictly classical inferences do not interfere with the generation of an infinite reduction sequence and that the liar sentence may implicitly entail strictly classical inferences. Should this analysis hold, it would call into question not only Tennant’s motivation for advancing the methodological conjecture, but also challenge his contention that genuine paradoxes—exemplified by the liar paradox—are never constructed with reliance on strictly classical inferences. (shrink)

The ambition of this paper is extensive: to bring about a new paradigm and firm mathematical foundations to Metaphysics, to aid its progress from the realm of mystical speculation to the realm of scientific scrutiny. -/- More precisely, this paper aims to introduce the field of Metaphysical Cosmology. The Metaphysical Cosmos here refers to the complete structure containing all entities, both existent and non-existent, with the physical universe as a subset. Through this paradigm, future endeavours in Metaphysical Science could thus (...) analyse non-physical parts of the Metaphysical Cosmos. New logical notions are displayed as tools for Metaphysical Cosmology, such as a Metric-Space-based predicate system, as well as a revised version of the Existential Quantifier. -/- A type system is presented to derive a construction of the Metaphysical Cosmos. The system is structured through semantic and syntactic definitions in a coherent way and holds only one proper axiom: the existence of (at least) one entity. This paper itself serves as an empirical proof for this axiom. Formulae and equations that depict a clear logical and mathematical structure of the Metaphysical Cosmos are derived from the definitions of the system and this axiom. -/- This culminates in the "Sixth Theorem", whose proof displays logically that there must be something rather than nothing. A computational simulation of the Sixth Theorem is also provided, alongside with methods for a future Metaphysical Science. Thus, this paper does not aim to provide a traditional philosophical argument but rather a mathematical foundation and new paradigm for the science of Metaphysics. (shrink)

Truthmaker semantics is a recent development in formal and philosophical semantics, with similar motivation and scope to possible worlds semantics. The technical background is rather different, however, and results in a more fine-grained hyperintensional notion of content, allowing us to distinguish between classically equivalent propositions. After briefly introducing the main ideas, this entry will describe the technical apparatus of state spaces and the central notions of content and partial content. It will then outline applications of truthmaker semantics in language, logic, (...) and other areas of philosophy. (shrink)

Can God create an unliftable stone? Beall & Cotnoir propose that ‘God can create an unliftable stone’ is a truth-value gap (neither true nor false). However, this yields a revenge paradox on whether God can eschew gaps. Can God avoid gappy ascriptions of power? Either way, God’s power seems to have limits. In response, it may be said that ascribing God the power to avoid gaps is itself gappy—it concerns a power that God neither has nor lacks. Yet this ends (...) up being inconsistent, for it implies that God definitely lacks that power. Following Aquinas, perhaps Beall & Cotnoir could accept this lack and still uphold omnipotence, suggesting that the power to avoid gaps is impossible for God. Yet the Aquinian stratagem is enough to block the original paradox, which saps the motivation to proffer truth-value gaps in addition. I conclude that the gappy solution is either inadequate or insufficiently motivated. (shrink)

Stephen Yablo has argued that ascriptions of belief and knowledge are sensitive to _subject matter_ and that theorising in such terms may help resolve philosophical questions about the semantics of such ascriptions. _Truthmaker semantics_ offers a way of theorising about subject matters. My main aim in this paper is to investigate what a semantics for knowledge or belief ascriptions might look like within truthmaker semantics. I then discuss what the resulting account might have to say about the problem of logical (...) omniscience, the nature of concepts, and rational belief. (shrink)

Axel A. Barceló takes issue with my discussion of the dominant gender conception—according to which “woman” is the classical negation of “man”—as an example of logic-based hermeneutical injustice. His arguments are embedded in a more general critique of revisionist projects within feminist logic. [...] Barceló’s particular response relies on a number of assumptions which I think are worth pushing back against. In particular, I will argue that feminist logical revisionism does not depend on giving up universality or proving classical logical (...) truths wrong; that feminist logical revisionist arguments are not meant to be judged in isolation from the rest of the logic literature; and that exploratory work in non-classical feminist logic stands in no special need of justification. (shrink)

In artificial intelligence (AI), responses generated by machine-learning models (most often large language models) may be unfactual information presented as a fact. For example, a chatbot might state that the Mona Lisa was painted in 1815. Such phenomenon is called AI hallucinations, seeking inspiration from human psychology, with a great difference of AI ones being connected to unjustified beliefs (that is, AI “beliefs”) rather than perceptual failures). -/- AI hallucinations may have their source in the data itself, that is, the (...) source content, or in the training procedure, i.e. the way the knowledge was encoded in the model’s parameters, so that errors in encoding and decoding textual and non-textual representations can cause hallucinations. In this paper, we will observe how such errors come to life and how they might be mitigated. For this purpose, we will analyze the usability of justification logics, to behave as a proof checker for validating the correctness of large language models’ (LLM) responses. Justification logic was developed by S. Artemov, and later on mostly by Artemov and M. Fitting, deriving its main idea from the logic of proofs (LP): knowledge and belief modalities are seen as justification terms, i.e. t:X stands for t is a (proper) justification for X. Justification logic originated from attempts to create semantics for intuitionistic logic where proofs were the most proper justifications, but in further development, justification logic could be applied to different kinds of justifications). With the recent attempts to mitigate incorrect LLM responses, we will analyze various guardrails that are currently used for LLM responses, and see how the logic of justification may provide its benefits as an AI safety layer against false data. (shrink)

The aim of this article is to show that, just as in recent years Cobreros, Egré, Ripley and van Rooij have provided a non-transitive counterpart of classical logic (i.e. one in which all classically acceptable inferences are valid but Cut and other metainferences are not), the same can be done for every Tarskian logic, with full generality. To establish this fact, a semantic approach is taken by showing that appropriate structures can be devised to characterize a non-transitive counterpart of every (...) Tarskian logic, starting from the logical matrices that are usually taken to render them. (shrink)

I propose an approach to liar and Curry paradoxes inspired by the work of Roger Swyneshed in his treatise on insolubles (1330-1335). The keystone of the account is the idea that liar sentences and their ilk are false (and only false) and that the so-called ''capture'' direction of the T-schema should be restricted. The proposed account retains what I take to be the attractive features of Swyneshed's approach without leading to some worrying consequences Swyneshed accepts. The approach and the resulting (...) logic (called ''Swynish Logic'') are non-classical, but are consistent and compatible with many elements of the classical picture including modus ponens, modus tollens, and double-negation elimination and introduction. It is also compatible with bivalence and contravalence. My approach to these paradoxes is also immune to an important kind of revenge challenge that plagues some of its rivals. (shrink)

The concept of topic-neutrality, though central to contemporary characterisations of logic, lacks a standard formal definition. I propose a formal reconstruction of topic-neutrality in terms of a topical partition of atoms and its applicability across consequence relations. I explore the implications of this reconstruction for logical pluralism and monism, distinguishing between topic-neutral and topic-specific variants of each. I argue that while topic-neutral pluralism posits various applicable consequence relations across domains, topic-specific pluralism holds that some relations are applicable only to specific (...) domains. (shrink)

This paper challenges the negative attitudes towards labelled proof systems, usually referred to as semantic pollution, by arguing that such critiques overlook the full potential of labelled calculi. The overarching objective is to develop a practice-based philosophical analysis of labelled calculi to provide insightful considerations regarding their proof-theoretic and philosophical value. To achieve this, successful applications of labelled calculi and related results will be showcased, and comparisons with other relevant works will be discussed. The paper ends by advocating for a (...) more practice-based approach towards the philosophical understanding of proof systems and their role in structural proof theory. (shrink)

Hyperlogic is a hyperintensional system designed to regiment metalogical claims (e.g., “Intuitionistic logic is correct” or “The law of excluded middle holds”) into the object language, including within embedded environments such as attitude reports and counterfactuals. This paper is the first of a two-part series exploring the logic of hyperlogic. This part presents a minimal logic of hyperlogic and proves its completeness. It consists of two interdefined axiomatic systems: one for classical consequence (truth preservation under a classical interpretation of the (...) connectives) and one for “universal” consequence (truth preservation under any interpretation). The sequel to this paper explores stronger logics that are sound and complete over various restricted classes of models as well as languages with hyperintensional operators. (shrink)

‘Feminist logic’ may sound like an impossible, incoherent, or irrelevant project, but it is none of these. We begin by delineating three categories into which projects in feminist logic might fall: philosophical logic, philosophy of logic, and pedagogy. We then defuse two distinct objections to the very idea of feminist logic: the irrelevance argument and the independence argument. Having done so, we turn to a particular kind of project in feminist philosophy of logic: Valerie Plumwood's feminist argument for a relevance (...) logic. Plumwood's work serves as our primary case study as we turn to the project of considering three different ways we might understand her argument and revisionist arguments like it: as a priori theorizing, as ameliorative conceptual engineering, or as instances of anti-exceptionalist approaches to logic. After arguing that the anti-exceptionalist approach seems to provide the most promising means of understanding the kind of project undertaken in a feminist challenge to classical logic, we briefly address the consequences that this might have for logic instruction. Here, we argue for the perhaps unexpected conclusion that feminist programs ought to offer more, not less, instruction in logic for those who take interest. (shrink)

The paper is structured as follows. First, I will single out three salient moments of trans philosophy, drawing on both my own experience as a trans person and the various attempts to theorize transness as laid out by Talia Mae Bettcher's "Trapped in the Wrong Theory". From there, I will extrapolate three ways to see the relationship between logic and trans philosophy, and provide for each some examples of both current and possible future work. Finally, in analogy with the literature (...) on feminist logic, I will attempt to address the further question of what trans logic could be, as a discipline and a system. (shrink)

This open access book is a superb collection of some fifteen chapters inspired by Schroeder-Heister's groundbreaking work, written by leading experts in the field, plus an extensive autobiography and comments on the various contributions by Schroeder-Heister himself. For several decades, Peter Schroeder-Heister has been a central figure in proof-theoretic semantics, a field of study situated at the interface of logic, theoretical computer science, natural-language semantics, and the philosophy of language. -/- The chapters of which this book is composed discuss the (...) subject from a rich variety of angles, including the history of logic, the proper interpretation of logical validity, natural deduction rules, the notions of harmony and of synonymy, the structure of proofs, the logical status of equality, intentional phenomena, and the proof theory of second-order arithmetic. All chapters relate directly to questions that have driven Schroeder-Heister's own research agenda and to which he has made seminal contributions. The extensive autobiographical chapter not only provides a fascinating overview of Schroeder-Heister's career and the evolution of his academic interests but also constitutes a contribution to the recent history of logic in its own right, painting an intriguing picture of the philosophical, logical, and mathematical institutional landscape in Germany and elsewhere since the early 1970s. The papers collected in this book are illuminatingly put into a unified perspective by Schroeder-Heister's comments at the end of the book. Both graduate students and established researchers in the field will find this book an excellent resource for future work in proof-theoretic semantics and related areas. (shrink)

This paper generalises an argument for probabilism due to Lindley [9]. I extend the argument to a number of non-classical logical settings whose truth-values, seen here as ideal aims for belief, are in the set $\{0,1\}$, and where logical consequence $\models $ is given the “no-drop” characterization. First I will show that, in each of these settings, an agent’s credence can only avoid accuracy-domination if its canonical transform is a (possibly non-classical) probability function. In other words, if an agent values (...) accuracy as the fundamental epistemic virtue, it is a necessary requirement for rationality that her credence have some probabilistic structure. Then I show that for a certain class of reasonable measures of inaccuracy, having such a probabilistic structure is sufficient to avoid accuracy-domination in these non-classical settings. (shrink)

The present article employs a model-theoretic semantics to interpret a fragment of the language of the Quantified Argument Calculus (Quarc), a recently introduced logical system whose main aim is capturing the structure of natural language sentences in a closer way than does the language of classical logic. The main contribution is an axiomatization for the set of formulas that are valid in all standard interpretations within the employed semantics.

In contemporary works on conditionals, the Ramsey test is a procedure for the evaluation of conditional sentences. There are several versions of the test, all inspired by a footnote by the British philosopher and mathematician Frank Ramsey, in his General Propositions and Causality. However, no study on Ramsey's own account of conditionals has been put forth so far. Furthermore, the footnote seems to cover indicative conditionals only, and this has led to the belief that no account of counterfactuals can be (...) found in Ramsey's work. In this paper, I recover Ramsey's account of counterfactuals and show that it is sketched in the footnote too. The result is a well-developed account of counterfactuals that resembles many contemporary ones. But Ramsey uses the same approach also for other types of conditionals, and this casts doubts on the current criteria for the classification of this type of sentences. (shrink)

Mathematics, even more than the other sciences, is often presented as essentially unique, as if it could not be any other way. And yet, prima facie alternative mathematics are all over the place, from non-Western mathematics to mathematics based on nonclassical logics. Taking inspiration from Robin Dembroff’s analysis of critical gender kinds, and from Andrew Aberdein and Stephen Read’s analysis of alternative logics, in this paper I will introduce a practice-centered framework for the study of alternative mathematics based on the (...) notion of critical math kind. After sketching a model of mainstream mathematics, I will provide examples of how deviation along several distinct dimensions can occur, and how deviations can vary in their gravity. I will then discuss how the framework can be used to think of questions concerning the alternativeness status and philosophical implications of alleged alternative mathematics, and help us in identifying alternatives that suit our purposes. (shrink)

Val Plumwood charged classical logic not only with the invalidity of some of its laws, but also with the support of systemic oppression through naturalization of the logical structure of dualisms. In this paper I show that the latter charge - unlike the former - can be carried over to classical mathematics, and I propose a new conception of inconsistent mathematics - queer incomaths - as a liberatory activity meant to undermine said naturalization.

A metainference is usually understood as a pair consisting of a collection of inferences, called premises, and a single inference, called conclusion. In the last few years, much attention has been paid to the study of metainferences—and, in particular, to the question of what are the valid metainferences of a given logic. So far, however, this study has been done in quite a poor language. Our usual sequent calculi have no way to represent, e.g. negations, disjunctions or conjunctions of inferences. (...) In this paper we tackle this expressive issue. We assume some background sentential language as given and define what we call an inferential language, that is, a language whose atomic formulas are inferences. We provide a model-theoretic characterization of validity for this language—relative to some given characterization of validity for the background sentential language—and provide a proof-theoretic analysis of validity. We argue that our novel language has fruitful philosophical applications. Lastly, we generalize some of our definitions and results to arbitrary metainferential levels. (shrink)

We investigate an approach for drawing logical inference from inconsistent premisses. The main idea in this approach is that the inconsistencies in the premisses should be interpreted as uncertainty of the information. We propose a mechanism, based on Kinght’s [14] study of inconsistency, for revising an inconsistent set of premisses to a minimally uncertain, probabilistically consistent one. We will then generalise the probabilistic entailment relation introduced in [15] for propositional languages to the first order case to draw logical inference from (...) a probabilistic set of premisses. We will show how this combination can allow us to limit the effect of uncertainty introduced by inconsistent premisses to only the reasoning on the part of the premise set that is relevant to the inconsistency. (shrink)

An exact truthmaker for A is a state which, as well as guaranteeing A’s truth, is wholly relevant to it. States with parts irrelevant to whether A is true do not count as exact truthmakers for A. Giving semantics in this way produces a very unusual consequence relation, on which conjunctions do not entail their conjuncts. This feature makes the resulting logic highly unusual. In this paper, we set out formal semantics for exact truthmaking and characterise the resulting notion of (...) entailment, showing that it is compact and decidable. We then investigate the effect of various restrictions on the semantics. We also formulate a sequent-style proof system for exact entailment and give soundness and completeness results. (shrink)

The Quantified Argument Calculus (Quarc) is a formal logic system, first developed by Hanoch Ben-Yami in (Ben-Yami 2014), and since then extended and applied by several authors. The aim of this paper is to further these contributions by, first, providing a philosophical motivation for the truth-valuational, substitutional approach of (Ben-Yami 2014) and defending it against a common objection, a topic also of interest beyond its specific application to Quarc. Second, we fill the formal lacunae left in the original presentation, which (...) did not incorporate identity systematically into Quarc, and although it proved the soundness of the system did not prove its completeness. (shrink)

Classical theists hold that God is omnipotent. But now suppose a critical atheologian were to ask: Can God create a stone so heavy that even he cannot lift it? This is the dilemma of the stone paradox. God either can or cannot create such a stone. Suppose that God can create it. Then there's something he cannot do – namely, lift the stone. Suppose that God cannot create the stone. Then, again, there's something he cannot do – namely, create it. (...) Either way, God cannot be omnipotent. Among the variety of known theological paradoxes, the paradox of the stone is especially troubling because of its logical purity. It purports to show that one cannot believe in both God and the laws of logic. In the face of the stone paradox, how should the contemporary analytic theist respond? Ought they to revise their belief in theology or their belief in logic? Ought they to lose their religion or lose their mind? (shrink)

In natural language, conditionals are frequently used for giving explanations. Thus the antecedent of a conditional is typically understood as being connected to, being relevant for, or providing evidential support for the conditional's consequent. This aspect has not been adequately mirrored by the logics that are usually offered for the reasoning with conditionals: neither in the logic of the material conditional or the strict conditional, nor in the plethora of logics for suppositional conditionals that have been produced over the past (...) 50 years. In this paper I survey some recent attempts to come to terms with the problem of encoding evidential support or relevance in the logic of conditionals. I present models in a qualitative-modal and in a quantitative-probabilistic setting. Focussing on some particular examples, I show that no perfect match between the two kinds of settings has been achieved yet. (shrink)

We focus on a branch of region-based spatial logics dealing with affine geometry. The research on this topic is scarce: only a handful of papers investigate such systems, mostly in the case of the real plane. Our long-term goal is to analyse certain family of affine logics with inclusion and convexity as primitives interpreted over real spaces of increasing dimensionality. In this article we show that logics of different dimensionalities must have different theories, thus justifying further work on different dimensions. (...) We then focus on the three-dimensional case, exploring the expressiveness of this logic and consequently showing that it is possible to construct formulas describing a three-dimensional coordinate frame. The final result, making use of the high expressive power of this logic, is that every region satisfies an affine complete formula, meaning that all regions satisfying it are affine equivalent. (shrink)

In the book, the decisive, foundational role of transcendental apperception for logic and transcendental philosophy in Kant is corroborated. The book contains many implicit connections with modern logic that could help a logician with a philosophical interest to gain a deeper insight into the origins and foundations of concepts such as object, truth, analyticity, identity, contradiction, judgment, existence, reference, quantification and others, as well as into the foundations and possible general features of logic. In distinction to the book, this review (...) emphasizes the objective validity of analytic judgements and the foundational role of hypthetical and disjunctive forms of a judgment in Kant. (shrink)

We introduce Arbitrary Public Announcement Logic with Memory (APALM), obtained by adding to the models a ‘memory’ of the initial states, representing the information before any communication took place (“the prior”), and adding to the syntax operators that can access this memory. We show that APALM is recursively axiomatizable (in contrast to the original Arbitrary Public Announcement Logic, for which the corresponding question is still open). We present a complete recursive axiomatization, that includes a natural finitary rule, and study this (...) logic’s expressivity and the appropriate notion of bisimulation. We then examine Group Announcement Logic with Memory (GALM), the extension of APALM obtained by adding to its syntax group announcement operators, and provide a complete finitary axiomatization (again in contrast to the original Group Announcement Logic, for which the only known axiomatization is infinitary). We also show that, in the memory-enhanced context, there is a natural reduction of the so-called coalition announcement modality to group announcements (in contrast to the memory-free case, where this natural translation was shown to be invalid). (shrink)

In this paper we study the interaction between symmetric logic and probability. In particular, we axiomatize the convex hull of the set of evaluations of symmetric logic, yielding the notion of probability in symmetric logic. This answers an open problem of Williams ( 2016 ) and Paris ( 2001 ).

Some think that logic concerns the “laws of truth”; others that logic concerns the “laws of thought.” This paper presents a way to reconcile both views by building a bridge between truth-maker theory, à la Fine, and normative bilateralism, à la Restall and Ripley. The paper suggests a novel way of understanding consequence in truth-maker theory and shows that this allows us to identify a common structure shared by truth-maker theory and normative bilateralism. We can thus transfer ideas from normative (...) bilateralism to truth-maker theory, such as non-transitive solutions to paradox, and vice versa, such as notions of factual equivalence and containment. (shrink)

The logical formalism of abductive reasoning is still an open discussion and various theories have been presented about it. Abduction is a type of non-monotonic and defeasible reasonings, and the logic containing such a reasoning is one of the types of non-nonmonotonic and defeasible logics, such as inductive logic. Abduction is a kind of natural reasoning and it is a solution to the problems having this form "the phenomenon of φ cannot be explained by the theory of Θ" and we (...) need to search for (or to adduce) an explanation for φ. Taking α as the explanation and <Θ,φ> as the abductive problem, Θ∪{α}⊨φ is the logical format of a strong abductive reasoning. In this article, the proof theory for first-order abductive calculus is proposed based on Gentzen-type first-order proof theory. Considering its dual, i.e., the semantic tableaux, and without the need to translate the formulas, this calculation is sound and complete. After examining the structural rules of this calculus, some metalogical considerations and open problems such as consistency, completeness and undecidability of this account have been addressed. (shrink)

By introducing and extending description logic (DLs) and growing up their application in knowledge representation and especially in OWLs and semantic web scope, many shortcomings and bugs were identified that weren’t resolvable in classical DLs and so logicians and computer scientists intended to non-classical and non-monotonic reasoning tools. In this paper, I discuses about abduction problem solvers, and by introducing A-Box abduction in description logics (DLs), such as ALC, discuss about decidability and complexity in different introduced algorithms, and report shortly (...) our team’s advantages in developing and implementation of ΑBox abduction in DLs. (shrink)

One of the main problems in t-norm fuzzy logic's meta-theorems is that despite the strong completeness of BL’s extensions such as Łukasiewicz (Ł), Gödel (G) and Product (Π) logics (i.e., Multi-valued, Gödel and Product standard algebras on [0,1] interval) in the propositional approach, in the first-order approach, given their standard chains and corresponding algebras, they aren't complete and strongly complete. One solution to this problem is that the first-order approaches of different fuzzy logics are complete and even strongly complete with (...) respect to non-standard single chains. But despite the success of this method in proving the strong completeness of many fuzzy logics such as TM, NM, BL, SBL, Ł and their first-order extensions, G and its first-order extensions, Π and its first-order extensions, the n-contraction logics SBLn, and Every finite valued extension of BL (such as finite valued Łukasiewicz (Łn) and finite valued Gödel (Gn)), there are three open problems: (1) Are MTL, IMTL, PMTL, WNM and their first-order extensions, (strongly) complete w.r.t. a single chain? (2) Although SMTL and SBL are strongly chain complete, Are SMTL∀ and SBL∀ also strongly completeness w.r.t. a single chain? And, (3) does chain completeness entail strong chain completeness or not? Answering these open problems and proving the completeness or incompleteness of these logics is the main purpose of this study, which will be achieved by some algebraic and meta-logical strategies. (shrink)

Spiritual Intelligence (S-Intelligence) introduced to achieve higher levels of knowledge and applying hidden knowledge. This intelligence is various in different people. When people work together in a team or set, these diverse influence on their performance. Facilitate the application of spiritual capacities by using abilities of S- intelligence is important to increase productivity teamwork. For this purpose, we provided a model of communication for individuals with different S-intelligence in performing team tasks. First, with the basics S-intelligence analysis and interviews with (...) experts, S-intelligence was divided in five categories. Each person according to their S-Intelligence and the role that play in teamwork (individualist, thinkist and pragmatist) from this aspect that he/she can by what kind of S-intelligences and what kind of role, has an effective team relationship, has been measured. With the 690 questionnaires … . (shrink)

Since McCall (1966), the heterodox principle of propositional logic that it is impossible for a proposition to be entailed by its own negation—in symbols, ¬(¬φ→φ)—has gone by the name of Aristotle’s thesis, since Aristotle apparently endorses it in Prior Analytics 2.4, 57b3–14. Scholars have contested whether Aristotle did endorse his eponymous thesis, whether he could do so consistently, and for what purpose he endorsed it if he did. In this article, I reconstruct Aristotle’s argument from this passage and show that (...) he accepts this thesis. Further, I show that the argument he gives is, making plausible assumptions, a correct proof in a consistent fragmentary nonclassical metalogic for a metatheorem he previously states concerning his assertoric syllogistic. In this way, Aristotle’s argument emerges as a fascinating case study in the use of a nonclassical metalogic to prove a result about a nonclassical object system. (shrink)

La introducción del grado de dependencia (y en consecuencia el grado de independencia) entre los componentes del conjunto difuso, y también entre los componentes del conjunto neutrosófico, se introduce por primera vez en la quinta edición del libro de Neutrosofía en el año 2006, basado en los elementos descritos en dicha edición del libro, se comienza a conocer conceptos de conjuntos neutrosóficos de los componentes borrosos así como los grados de dependencia e independencia, Por tal motivo el objetivo del presente (...) trabajo es extender el conjunto neutrosófico refinado, teniendo en cuenta la grado de dependencia o independencia de los subcomponentes que integran los conjuntos borrosos y neutrosóficos. (shrink)

We have introduced for the first time the degree of dependence (and consequently the degree of independence) between the components of the fuzzy set, and also between the components of the neutrosophic set in our 2006 book’s fifth edition [1]. Now we extend it for the first time to the refined neutrosophic set considering the degree of dependence or independence of subcomponets.

In this first books of scilogs collected from my nest of ideas, one may find new and old questions and solutions, some of them already put at work, others dead or waiting, referring to neutrosophy – email messages to research colleagues, or replies, notes about authors, articles or books, so on.

In this second book of scilogs collected from my nest of ideas, one may find new and old questions and solutions, some of them already put at work, others dead or waiting, referring to many topics (see Topics) in different fields of research – email messages to research colleagues, or replies, notes about authors, articles, or books, so on – in an eager pursuit (consectatio) for meanings, reasons, and purports of (scientific) things (res).

In this third book of scilogs collected from my nest of ideas, one may find new and old questions and solutions, referring to topics on NEUTROSOPHY – email messages to research colleagues, or replies, notes about authors, articles, or books, so on. Feel free to budge in or just use the scilogs as open source for your own ideas!

In this fourth book of scilogs collected from my nest of ideas, one may find new and old questions and solutions, referring mostly to topics on NEUTROSOPHY – email messages to research colleagues, or replies, notes about authors, articles, or books, so on. Feel free to budge in or just use the scilogs as open source for your own ideas!

In this fifth book of scilogs collected from my nest of ideas, one may find new and old questions and solutions, mostly referring to topics on NEUTROSOPHY – email messages to research colleagues, or replies, notes about authors, articles, or books, so on. Feel free to budge in or just use the scilogs as open source for your own ideas!

In this sixth book of scilogs collected from my nest of ideas, one may find new and old questions and solutions, referring to topics on NEUTROSOPHY – email messages to research colleagues, or replies, notes about authors, articles, or books, and so on. Feel free to budge in or just use the scilogs as open source for your own ideas!