Logical Semantics and Logical Truth

Just started a new book. The aim is to establish a science of knowledge in the same way that we have a science of physics or a science of materials. This might appear as an overly ambitious, possibly arrogant, objective, but bear with me. On the day I am beginning to write it–June 7th, 2020–, I think I am in possession of a few things that will help me to achieve this objective. Again, bear with me. My aim is well (...) reflected in the title I chose (just now) for this book: Knowledge & Logic: Towards a science of knowledge. Its most important feature is that I shall take logic to be to knowledge science as calculus is to physics or to materials science. I do not intend to reclaim knowledge from the bosom of philosophy, in which, known as epistemology its erudite discussion has hardly progressed since Plato first defined it as true belief with logos. With only a few adjustments, it will actually provide me with the right, science-bound start. More recently, knowledge has been reclaimed by the field of BA, a reclaim that has opened the box of Pandora: Among the evils, and perhaps at the head of the list, is an overly lay, essentially naive, notion of knowledge. But the very idea that one can have something like “knowledge (management) software” puts us on the right track. (shrink)

Georg Cantor was the genuine discoverer of the Mathematical Infinity, and whatever he claimed, suggested, or even surmised should be taken seriously -- albeit not necessary at its face value. Because alongside his exquisite in beauty ordinal construction and his fundamental powerset description of the continuum, Cantor has also left to us his obsessive presumption that the universe of sets should be subjected to laws similar to those governing the set of natural numbers, including the universal principles of cardinal comparability (...) and well-ordering -- and implying an ordinal re-creation of the continuum. During the last hundred years, the mainstream set-theoretical research -- all insights and adjustments due to Kurt G\"odel's revolutionary insights and discoveries notwithstanding -- has compliantly centered its efforts on ad hoc axiomatizations of Cantor's intuitive transfinite design. We demonstrate here that the ontological and epistemic sustainability} of this design has been irremediably compromised by the underlying peremptory, Reductionist mindset of the XIXth century's ideology of science. (shrink)

Homo deceptus is a book that brings together new ideas on language, consciousness and physics into a comprehensive theory that unifies science and philosophy in a different kind of Theory of Everything. The subject of how we are to make sense of the world is addressed in a structured and ordered manner, which starts with a recognition that scientific truths are constructed within a linguistic framework. The author argues that an epistemic foundation of natural language must be understood before laying (...) claim to any notion of reality. This foundation begins with Ludwig Wittgenstein’s Tractatus Logico-Philosophicus and the relationship of language to formal logic. Ultimately, we arrive at an answer to the question of why people believe the things they do. This is effectively a modification of Alfred Tarski’s semantic theory of truth. The second major issue addressed is the ‘dreaded’ Hard Problem of Consciousness as first stated by David Chalmers in 1995. The solution is found in the unification of consciousness, information theory and notions of physicalism. The physical world is shown to be an isomorphic representation of the phenomenological conscious experience. New concepts in understanding how language operates help to explain why this relationship has been so difficult to appreciate. The inclusion of concepts from information theory shows how a digital mechanics resolves heretofore conflicting theories in physics, cognitive science and linguistics. Scientific orthodoxy is supported, but viewed in a different light. Mainstream science is not challenged, but findings are interpreted in a manner that unifies consciousness without contradiction. Digital mechanics and formal systems of logic play central roles in combining language, consciousness and the physical world into a unified theory where all can be understood within a single consistent framework. (shrink)

According to Aristotle if a universal proposition (for example: “All men are white”) is true, its contrary proposition (“All men are not white”) must be false; and, according to Aristotle, if a universal proposition (for example: “All men are white”) is true, its contradictory proposition (“Not all men are white”) must be false. I agree with what Aristotle wrote about universal propositions, but there are universal propositions which have no contrary proposition and have no contradictory proposition. The proposition X “All (...) the propositions that contradict this proposition are true” does not have the contrary proposition and does not have the contradictory proposition. In fact: FEX “All the propositions that contradict this proposition are not true” has a different subject: the subject of the proposition X is constituted by all the propositions that contradict the proposition X; by contrast, the subject of the proposition FEX is constituted by all the propositions that contradict the proposition FEX. And FOX “Not all the propositions that contradict this proposition are true” has a different subject: the subject of the proposition X is constituted by the propositions that contradict the proposition X; by contrast, the subject of the proposition FOX is constituted by the propositions that contradict the proposition FOX. According to Aristotle, a singular proposition (in his example: "Socrates is white") which is true must have its negative proposition ("Socrates is not white") which is false. I agree with Aristotle, but there are singular propositions which do not have the corresponding negative proposition. The proposition (or, rather, the pseudo-proposition) L “This same statement is not true” does not have the negative proposition because the proposition FNL “This same statement is true” has a different subject from the subject of the proposition L: the subject of the proposition L is the proposition L; by contrast, the subject of the proposition FNL is the proposition FNL. L and FNL cannot have the same subject. By contrast, the proposition M “This mount is entirely in Swiss territory” and the proposition NM “This mount is not entirely in Swiss territory” can have the same subject (for example, the Mount Eiger): in case the subject of the proposition M and the subject of the proposition NM is the same, M and NM are opposite propositions, NM is the negative proposition of M. By contrast, the proposition (or, rather, the pseudo-proposition) L "This same statement is not true" cannot have the corresponding negative proposition because FNL "This same statement is true" has a different subject: the subject of L is L ; by contrast, the subject of FNL is FNL. Then the paper continues by analyzing some variants of the liar’s paradox: L1 “The statement L1 is not true”; the so-called liar cycle; and the so-called Yablo’s paradox. (shrink)

Inspired by the early Wittgenstein’s concept of nonsense (meaning that which lies beyond the limits of language), we define two different, yet complementary, types of nonsense: formal nonsense and pragmatic nonsense. The simpler notion of formal nonsense is initially defined within Tarski’s semantic theory of truth; the notion of pragmatic nonsense, by its turn, is formulated within the context of the theory of pragmatic truth, also known as quasi-truth, as formalized by da Costa and his collaborators. While an expression will (...) be considered formally nonsensical if the formal criteria required for the assignment of any truth-value (whether true, false, pragmatically true, or pragmatically false) to such sentence are not met, a (well-formed) formula will be considered pragmatically nonsensical if the pragmatic criteria (inscribed within the context of scientific practice) required for the assignment of any truth-value to such sentence are not met. Thus, in the context of the theory of pragmatic truth, any (well-formed) formula of a formal language interpreted on a simple pragmatic structure will be considered pragmatically nonsensical if the set of primary sentences of such structure is not well-built, that is, if it does not include the relevant observational data and/or theoretical results, or if it does include sentences that are inconsistent with such data. (shrink)

The concept of truth has many aims but only one source. The article describes the primary concept of truth, here called the synthetic concept of truth, according to which truth is the objective result of the synthesis of us and nature in the process of rational cognition. It is shown how various aspects of the concept of truth -- logical, scientific, and mathematical aspect -- arise from the synthetic concept of truth. Also, it is shown how the paradoxes of truth (...) arise. (shrink)

Textbook for students in mathematical logic. Part 1. Total formalization is possible! Formal theories. First order languages. Axioms of constructive and classical logic. Proving formulas in propositional and predicate logic. Glivenko's theorem and constructive embedding. Axiom independence. Interpretations, models and completeness theorems. Normal forms. Tableaux method. Resolution method. Herbrand's theorem.

Throughout this paper, we are trying to show how and why our Mathematical frame-work seems inappropriate to solve problems in Theory of Computation. More exactly, the concept of turning back in time in paradoxes causes inconsistency in modeling of the concept of Time in some semantic situations. As we see in the first chapter, by introducing a version of “Unexpected Hanging Paradox”,first we attempt to open a new explanation for some paradoxes. In the second step, by applying this paradox, it (...) is demonstrated that any formalized system for the Theory of Computation based on Classical Logic and Turing Model of Computation leads us to a contradiction. We conclude that our mathematical frame work is inappropriate for Theory of Computation. Furthermore, the result provides us a reason that many problems in Complexity Theory resist to be solved.(This work is completed in 2017 -5- 2, it is in vixra in 2017-5-14, presented in Unilog 2018, Vichy). (shrink)

This paper provides a new framework for formalizing conditional obligations in natural language: it pairs a unary deontic operator with trivalent semantics for the indicative conditional and Kratzer's idea that the antecedents of conditionals restrict the scope of modals in the consequent. Combining these three ideas, we obtain a fully compositional theory of "if" and "ought'" that validates plausible principles for deontic reasoning. Moreover, it resolves classical challenges such as the "if A then ought A" problem, the paradox of the (...) miners and the modeling of contrary-to-duty obligations (e.g., Chisholm's quartet). All in all, our proposal is attractive from a logical point of view and squares well with general theories of natural language reasoning. (shrink)

I give an account of proof terms for derivations in a sequent calculus for classical propositional logic. The term for a derivation δ of a sequent Σ≻Δ encodes how the premises Σ and conclusions Δ are related in δ. This encoding is many–to–one in the sense that different derivations can have the same proof term, since different derivations may be different ways of representing the same underlying connection between premises and conclusions. However, not all proof terms for a sequent Σ≻Δ (...) are the same. There may be different ways to connect those premises and conclusions. -/- Proof terms can be simplified in a process corresponding to the elimination of cut inferences in sequent derivations. However, unlike cut elimination in the sequent calculus, each proof term has a unique normal form (from which all cuts have been eliminated) and it is straightforward to show that term reduction is strongly normalising—every reduction process terminates in that unique normal form. Further- more, proof terms are invariants for sequent derivations in a strong sense—two derivations δ1 and δ2 have the same proof term if and only if some permutation of derivation steps sends δ1 to δ2 (given a relatively natural class of permutations of derivations in the sequent calculus). Since not every derivation of a sequent can be permuted into every other derivation of that sequent, proof terms provide a non-trivial account of the identity of proofs, independent of the syntactic representation of those proofs. (shrink)

Cezary Cieśliński has proved a result shows that highlights `logical reflection': The principle that every logically provable sentence is true. He suggests further that this result has a good deal of philosophical significance, specifically for the so-called `conservativeness argument' against deflationism. This note discusses the question to what extent Cieśliński's result generalizes, and just how strong `logical reflection' is, and suggests that the answers to these questions call the philosophical (though not the technical) significance of Cieśliński's result into doubt.

Epistemic modals have peculiar logical features that are challenging to account for in a broadly classical framework. For instance, while a sentence of the form ‘p, but it might be that not p’ appears to be a contradiction, 'might not p' does not entail 'not p', which would follow in classical logic. Likewise, the classical laws of distributivity and disjunctive syllogism fail for epistemic modals. Existing attempts to account for these facts generally either under- or over-correct. Some theories predict that (...) 'p and might not p', a so-called epistemic contradiction, is a contradiction only in an etiolated sense, under a notion of entailment that does not allow substitution of logical equivalents; these theories underpredict the infelicity of embedded epistemic contradictions. Other theories savage classical logic, eliminating not just rules that intuitively fail, like distributivity and disjunctive syllogism, but also rules like non-contradiction, excluded middle, De Morgan’s laws, and disjunction introduction, which intuitively remain valid for epistemic modals. In this paper, we aim for a middle ground, developing a semantics and logic for epistemic modals that makes epistemic contradictions genuine contradictions and that invalidates distributivity and disjunctive syllogism but that otherwise preserves classical laws that intuitively remain valid. We start with an algebraic semantics, based on ortholattices instead of Boolean algebras, and then propose a more concrete possibility semantics, based on partial possibilities related by compatibility. Both semantics yield the same consequence relation, which we axiomatize. Then we show how to extend our semantics to explain parallel phenomena involving probabilities and conditionals. The goal throughout is to retain what is desirable about classical logic while accounting for the non-classicality of epistemic vocabulary. (shrink)

CAT4 is proposed as a general method for representing information, enabling a powerful programming method for large-scale information systems. It enables generalised machine learning, software automation and novel AI capabilities. This is Part 3 of a five-part introduction. The focus here is on explaining the semantic model for CAT4. Points in CAT4 graphs represent facts. We introduce all the formal (data) elements used in the classic semantic model: sense or intension (1st and 2nd joins), reference (3rd join), functions (4th join), (...) time and truth (logical fields), and symbolic content (name/value fields). Concepts are introduced through examples alternating with theoretical discussion. Some concepts are assumed from Part 1 and 2, but key ideas are re-introduced. The purpose is to explain the CAT4 interpretation, and why the data structure and CAT4 axioms have been chosen: to make the semantic model consistent and complete. We start with methods to translate information from database tables into graph DBs and into CAT4. We conclude with a method for translating natural language into CAT4. We conclude with a comparison of the system with an advanced semantic logic, the hyper-intensional logic TIL, which also aims to translate NL into a logical calculus. The CAT4 Natural Language Translator is discussed in further detail in Part 4, when we introduce functions more formally. Part 5 discusses software design considerations. (shrink)

We can classify the (truth-theoretic) paradoxes according to their degrees of paradoxicality. Roughly speaking, two paradoxes have the same degrees of paradoxicality, if they lead to a contradiction under the same conditions, and one paradox has a (non-strictly) lower degree of paradoxicality than another, if whenever the former leads to a contradiction under a condition, the latter does so under the same condition. In this paper, we outline some results and questions around the degrees of paradoxicality and summarize recent progress.

Wittgenstein’ın bir yaşam olayı olarak görmediği ölümün ne anlama geldiğine ilişkin düşüncesi açımlanıyor. Wittgenstein’ın düşüncesinin varlık-bilimsel dayanağı olan tek bir dünyanın var sayılması birden çok dünya varsayılan bir yaklaşımla karşılaştırılıyor.

This paper clarifies and defends the global approach to defining logical validity for meta- and higher-level inferences. This is contrary to an emerging consensus in favour of local validity. Prevalent recent arguments claim that global validity is either superfluous in virtue of collapsing into local, or else untenable because it overgenerates validities, compromises the formality of logic, or breaks symmetry with regular validity. Accordingly, the literature on higher inferential logic has come to focus almost exclusively on local validity. Many key (...) philosophical takeaways that have since been drawn from the field are effectively based on local monism: the view that local is the One True Validity Criterion. The present paper argues that this is a mistake, resulting largely from an imprecise understanding of global validity. I untangle some common confusions about how global generalizes beyond the metalevel, and submit that its proper formulation is schematic. These clarifications help dispel each of the aforementioned arguments against global, leaving local monism without any justification. Finally, I outline how much of the philosophical literature around higher-level inferences has been built on local monism, and sketch out the sweeping consequences of rejecting it. (shrink)

Is logic empirical? Is logic to be found in the world? Or is logic rather a convention, a product of conventions, part of the many rules that regulate the language game? Answers fall in either camp. We like the linguistic answer. In this paper, we want to analyze how a linguistic community would tackle the problem of developing a logic and show how the linguistic conventions adopted by the community determine the properties of the local logic. Then show how to (...) move from a notion of logic that varies from community to community to a notion of logic that is in a sense universal. The framework is conventional up to a point: we have sentences, atomic and composite, the connectives are interpreted, values are computed, and the value of a composite sentence is a function of the values of its subsentences. Less conventional is the use of a plurality of truth values, and the sharp distinction we draw between sentences and statements, in the spirit of the distinction between proposition and judgment that one may find in proof theory. The linguistic community will face many choices. What are the good ones, the ones to avoid? Are there, in some sense, optimal choices? These are the kind of issues we are addressing. Where do we end up? With some kind of universal bivalent logic, ironically enough. We start from an arbitrarily large number of truth values, atomic sentences and connectives, construct a generic many-valued logic, recover more or less the usual results and issues, and in the end it all comes down to a positive bivalent logic with two connectives, `and' and `or', as if logic is nothing more than a mere accounting of possibilities. (shrink)

Section 1 reviews Strawson’s logic of presuppositions. Strawson’s justification is critiqued and a new justification proposed. Section 2 extends the logic of presuppositions to cases when the subject class is necessarily empty, such as (x)((Px & ~Px) → Qx) . The strong similarity of the resulting logic with Richard Diaz’s truth-relevant logic is pointed out. Section 3 further extends the logic of presuppositions to sentences with many variables, and a certain valuation is proposed. It is noted that, given this valuation, (...) Gödel’s sentence becomes neither true nor false. The similarity of this outcome with Goldstein and Gaifman’s solution of the Liar paradox, which is discussed in section 4, is emphasized. Section 5 returns to the definition of meaningfulness; the meaninglessness of certain sentences with empty subjects and of the Liar sentence is discussed. The objective of this paper is to show how all of the above-mentioned concepts are interrelated. (shrink)

When are two formal theories of broadly logical concepts, such as truth, equivalent? The paper investigates a case study, involving two well-known variants Kripke-Feferman truth. The first, KF+CONS, features a consistent but partial truth predicate. The second, KF+COMP, an inconsistent but complete truth predicate. It is well-known that the two truth predicates are dual to each other. We show that this duality reveals a much stricter correspondence between the two theories: they are intertraslatable. Intertranslatability under natural assumptions coincides with definitional (...) equivalence, and is arguably the strictest notion of theoretical equivalence different from logical equivalence. The case of KF+CONS and KF+COMP raises a puzzle: the two theories can be proved to be strictly related, yet they appear to embody remarkably different conceptions of truth. We discuss the significance of the result for the broader debate on formal criteria of conceptual reducibility for theories of truth. (shrink)

The conventional notion of a formal system is adapted to conform to the sound deductive inference model operating on finite strings. Finite strings stipulated to have the semantic property of Boolean true provide the sound deductive premises. Truth preserving finite string transformation rules provide valid the deductive inference. Conclusions of sound arguments are derived from truth preserving finite string transformations applied to true premises.

By extending the notion of a Well Formed Formula to include syntactically formalized rules for rejecting semantically incorrect expressions we recognize and reject expressions that have the semantic error of Pathological self-reference(Olcott 2004). The foundation of this system requires the notion of a BaseFact that anchors the semantic notions of True and False. When-so-ever a formal proof from BaseFacts of language L to a closed WFF X or ~X of language L does not exist X is decided to be semantically (...) incorrect. (shrink)

The conventional notion of a formal system is adapted to conform to the sound deductive inference model operating on finite strings. Finite strings stipulated to have the semantic value of Boolean true provide the sound deductive premises. Truth preserving finite string transformation rules provide the valid deductive inference. Sound deductive conclusions are the result of these finite string transformation rules.

Minimal Type Theory (MTT) is based on type theory in that it is agnostic about Predicate Logic level and expressly disallows the evaluation of incompatible types. It is called Minimal because it has the fewest possible number of fundamental types, and has all of its syntax expressed entirely as the connections in a directed acyclic graph.

We can simply define Gödel 1931 Incompleteness away by redefining the meaning of the standard definition of Incompleteness: A theory T is incomplete if and only if there is some sentence φ such that (T ⊬ φ) and (T ⊬ ¬φ). This definition construes the existence of self-contradictory expressions in a formal system as proof that this formal system is incomplete because self-contradictory expressions are neither provable nor disprovable in this formal system. Since self-contradictory expressions are neither provable nor disprovable (...) only because they are self-contradictory we could define them as unsound instead of defining the formal system as incomplete. (shrink)

Could the intersection of [formal proofs of mathematical logic] and [sound deductive inference] specify formal systems having [deductively sound formal proofs of mathematical logic]? All that we have to do to provide [deductively sound formal proofs of mathematical logic] is select the subset of conventional [formal proofs of mathematical logic] having true premises and now we have [deductively sound formal proofs of mathematical logic].

This sentence G ↔ ¬(F ⊢ G) and its negation G ↔ ~(F ⊢ ¬G) are shown to meet the conventional definition of incompleteness: Incomplete(T) ↔ ∃φ ((T ⊬ φ) ∧ (T ⊬ ¬φ)). They meet conventional definition of incompleteness because neither the sentence nor its negation is provable in F (or any other formal system). -- .

If a semantically open language has no constraints on self-reference, one can prove an absurdity. The argument exploits a self-referential function symbol where the expressed function ends up being intensional in virtue of self-reference. The prohibition on intensional functions thus entails that self-reference cannot be unconstrained, even in a language that is free of semantic terms. However, since intensional functions are already excluded in classical logic, there are no drastic revisionary implications here. Still, the argument reveals a new sort of (...) intensional context, one which does not depend on a propositional attitude verb, a modal operator, an idiom like 'so called', etc. Moreover, since classical logicians do not seem aware of the potential danger with self-reference, a word of warning is in order. (shrink)

This paper details an algorithm for a binary, primitive recursive function that apparently computes, for any $i$ and $n$, $f_i\left(i,n\right)$. The algorithm works by exploiting the fact that, in the formal system described, the index assigned to a p.r. function codes the definitional composition of the function. The algorithm exploits such a code to generate a "canonical proof" of $f_i\left(i,n\right)=m$. Since this kind of algorithm is shown impossible by diagonal arguments, the algorithm must be in error. But the error is (...) worth investigating, for it is unclear upon sustained, earnest reflection where it lies. I thus offer this material to readers with a humble request for assistance. (shrink)

Why do we use epistemic modals like 'might'? According to Factualism, the function of 'might' is to exchange information about state-of-affairs in the modal universe. As an alternative to Factualism, this paper offers a game-theoretic rationale for epistemic possibility operators in a Bayesian setting. The background picture is one whereby communication facilitates coordination, but coordination could fail if there's too much uncertainty, since the players' ability to share a belief is undermined. However, 'might' and related expressions can be used to (...) reveal one's uncertainty, and exploit this to coordinate despite the lack of a common epistemic ground. The final result is a way to articulate a non-Factualist view of epistemic possibility modals that builds on their standard semantics. (shrink)

By separating the general concept of truth into syntactic truth and semantic truth, this article proposes a new theory of truth to explain several paradoxes like the Liar paradox, Card paradox, Curry’s paradox, etc. By revealing the relationship between syntactic /semantic truth and being-nothing-becoming which are the core concepts of dialectical logic, it is able to formalize dialectical logic. It also provides a logical basis for complexity theory by transferring all reasoning into a directed (cyclic/acyclic) graph which explains both paradoxical (...) and paradox-free reasoning. The different structure between cyclic graphs and acyclic graphs is the key to understanding paradoxes. By explaining the immanent between logic, paradox, and cellular automata, it also illustrates dialectical logic as ontology. (shrink)

This paper introduces a new method of interpreting complex relation terms in a second-order quantified modal language. We develop a completely general second-order modal language with two kinds of complex terms: one kind for denoting individuals and one kind for denoting n-place relations. Several issues arise in connection with previous, algebraic methods for interpreting the relation terms. The new method of interpreting these terms described here addresses those issues while establishing an interesting connection between λ and ε calculi. The resulting (...) semantics provides a precise understanding of the theory of relations. (shrink)

I present a solution to the epistemological or characterisation problem of induction. In part I, Bayesian Confirmation Theory (BCT) is discussed as a good contender for such a solution but with a fundamental explanatory gap (along with other well discussed problems); useful assigned probabilities like priors require substantive degrees of belief about the world. I assert that one does not have such substantive information about the world. Consequently, an explanation is needed for how one can be licensed to act as (...) if one has substantive information about the world when one does not. I sketch the outlines of a solution in part I, showing how it differs from others, with full details to follow in subsequent parts. The solution is pragmatic in sentiment (though differs in specifics to arguments from, for example, William James); the conceptions we use to guide our actions are and should be at least partly determined by preferences. This is cashed out in a reformulation of decision theory motivated by a non-reductive formulation of hypotheses and logic. A distinction emerges between initial assumptions--that can be non-dogmatic--and effective assumptions that can simultaneously be substantive. An explanation is provided for the plausibility arguments used to explain assigned probabilities in BCT. -/- In subsequent parts, logic is constructed from principles independent of language and mind. In particular, propositions are defined to not have form. Probabilities are logical and uniquely determined by assumptions. The problems considered fatal to logical probabilities--Goodman's `grue' problem and the uniqueness of priors problem are dissolved due to the particular formulation of logic used. Other problems such as the zero-prior problem are also solved. -/- A universal theory of (non-linguistic) meaning is developed. Problems with counterfactual conditionals are solved by developing concepts of abstractions and corresponding pictures that make up hypotheses. Spaces of hypotheses and the version of Bayes' theorem that utilises them emerge from first principles. -/- Theoretical virtues for hypotheses emerge from the theory. Explanatory force is explicated. The significance of effective assumptions is partly determined by combinatoric factors relating to the structure of hypotheses. I conjecture that this is the origin of simplicity. (shrink)

In this multi-disciplinary investigation we show how an evidence-based perspective of quantification---in terms of algorithmic verifiability and algorithmic computability---admits evidence-based definitions of well-definedness and effective computability, which yield two unarguably constructive interpretations of the first-order Peano Arithmetic PA---over the structure N of the natural numbers---that are complementary, not contradictory. The first yields the weak, standard, interpretation of PA over N, which is well-defined with respect to assignments of algorithmically verifiable Tarskian truth values to the formulas of PA under the interpretation. (...) The second yields a strong, finitary, interpretation of PA over N, which is well-defined with respect to assignments of algorithmically computable Tarskian truth values to the formulas of PA under the interpretation. We situate our investigation within a broad analysis of quantification vis a vis: * Hilbert's epsilon-calculus * Goedel's omega-consistency * The Law of the Excluded Middle * Hilbert's omega-Rule * An Algorithmic omega-Rule * Gentzen's Rule of Infinite Induction * Rosser's Rule C * Markov's Principle * The Church-Turing Thesis * Aristotle's particularisation * Wittgenstein's perspective of constructive mathematics * An evidence-based perspective of quantification. By showing how these are formally inter-related, we highlight the fragility of both the persisting, theistic, classical/Platonic interpretation of quantification grounded in Hilbert's epsilon-calculus; and the persisting, atheistic, constructive/Intuitionistic interpretation of quantification rooted in Brouwer's belief that the Law of the Excluded Middle is non-finitary. We then consider some consequences for mathematics, mathematics education, philosophy, and the natural sciences, of an agnostic, evidence-based, finitary interpretation of quantification that challenges classical paradigms in all these disciplines. (shrink)

Description Logics (DLs) are a family of formal knowledge representation formalisms and the most well-known formalisms in semantics-based systems. The central focus of this research is on logical-terminological characterisation/analysis of possibilistic and probabilistic descriptions of events in DLs. Based on a logical characterisation of the concept of `being', this paper conceptualises events within DLs world descriptions. Accordingly, it deals with the concepts of `possibility of events' and `probability of events'. The main goal of this research is to investigate how possible (...) and probable notations can, terminologically and logically, be interpreted and analysed within DLs world descriptions. In other words, the research logically-terminologically investigates how possibilistic and probabilistic descriptions of events can be expressed in DLs. (shrink)

This paper is a short introduction to Carnap’s writings on semantics with an emphasis on the transition from the syntactic period to the semantic one. I claim that one of Carnap’s main aims was to investigate the possibility of the symmetry between the syntactic and the semantic methods of approaching philosophical problems, both in logic and in the philosophy of science. This ideal of methodological symmetry could be described as an attempt to obtain categorical logical systems, i.e., systems that allow (...) only the intended semantical interpretation. (shrink)

Extended abstract presented at the AISC 2018 Conference, 15th International Conference of the Italian Association of Cognitive Science, Pavia.

Tarski’s Convention T—presenting his notion of adequate definition of truth (sic)—contains two conditions: alpha and beta. Alpha requires that all instances of a certain T Schema be provable. Beta requires in effect the provability of ‘every truth is a sentence’. Beta formally recognizes the fact, repeatedly emphasized by Tarski, that sentences (devoid of free variable occurrences)—as opposed to pre-sentences (having free occurrences of variables)—exhaust the range of significance of is true. In Tarski’s preferred usage, it is part of the meaning (...) of true that attribution of being true to a given thing presupposes the thing is a sentence. Beta’s importance is further highlighted by the fact that alpha can be satisfied using the recursively definable concept of being satisfied by every infinite sequence, which Tarski explicitly rejects. Moreover, in Definition 23, the famous truth-definition, Tarski supplements “being satisfied by every infinite sequence” by adding the condition “being a sentence”. Even where truth is undefinable and treated by Tarski axiomatically, he adds as an explicit axiom a sentence to the effect that every truth is a sentence. Surprisingly, the sentence just before the presentation of Convention T seems to imply that alpha alone might be sufficient. Even more surprising is the sentence just after Convention T saying beta “is not essential”. Why include a condition if it is not essential? Tarski says nothing about this dissonance. Considering the broader context, the Polish original, the German translation from which the English was derived, and other sources, we attempt to determine what Tarski might have intended by the two troubling sentences which, as they stand, are contrary to the spirit, if not the letter, of several other passages in Tarski’s corpus. (shrink)

Some philosophers argue that a theory of logical validity should not interpret its own language, because a Russellian argument shows that self-applicability is inconsistent with the ability to capture all the interpretations of its own language. First, I set up a formal system to examine the Russellian argument. I then defend the need for self-applicability. I argue that self-applicability seems to be implied by generality, and that the Russellian argument rests on a test for meaning that is biased against self-applicability. (...) I propose an alternative test which is unproblematic for self-applicability. I conclude that self-applicability can be vindicated and the Russellian argument can be resisted. (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)

A general mathematical framework, based on countable partitions of Natural Numbers [1], is presented, that allows to provide a Semantics to propositional languages. It has the particularity of allowing both the valuations and the interpretation Sets for the connectives to discriminate complexity of the formulas. This allows different adequacy criteria to be used to assess formulas associated with the same connective, but that differ in their complexity. The presented method can be adapted potentially infinite number of connectives and truth values, (...) therefore, it can be considered a general framework to provide semantics to several of the known logic systems (eg, LC, L3 LP, FDE). The presented semantics allow to converge to different standard semantics if the separation complexity procedure is annulled. Therefore, it can be understood as a framework that allows greater precision (in complexity terms) with respect to formula satisfaction. Naturally, because of how it is built, it can be incorporated into non-deterministic semantics. The presented procedure also allows generating valuations that grant a different truth value to each formula of propositional language. As a positive side effect, our method allows a constructive proof of the equipotence between N and N^n for all Natural n. (shrink)

It is shown that one common formulation of Stalnaker's semantics for conditionals is incomplete: it has no sound and (strongly) complete proof system. At first, this seems to conflict with well-known completeness results for this semantics (e.g., Stalnaker and Thomason 1967; Stalnaker 1970 and Lewis 1973, ch. 6). As it turns out, it does not: these completeness results rely on another closely-related formulation of the semantics that is provably complete. Specifically, the difference comes down to how the Limit Assumption is (...) stated. I close with some remarks about what this means for the logic of conditionals. (shrink)

In this paper, we provide a semantics for a range of positive substructural logics, including both logics with and logics without modal connectives. The semantics is novel insofar as it is meant to explicitly capture the computational flavor of these logics, and to do so in a way that builds in both nondeterministic and nonconcurrent computational processes.

A notion of strictly primitive recursive realizability is introduced by Damnjanovic in 1994. It is a kind of constructive semantics of the arithmetical sentences using primitive recursive functions. It is of interest to study the corresponding predicate logic. It was argued by Park in 2003 that the predicate logic of strictly primitive recursive realizability is not arithmetical. Park’s argument is essentially based on a claim of Damnjanovic that intuitionistic logic is sound with respect to strictly primitive recursive realizability, but that (...) claim was disproved by the author of this article in 2006. The aim of this paper is to present a correct proof of the result of Park. (shrink)

This paper outlines a new pluralistic theory of normative reasons for belief, welfarist pluralism, which aims to explain how there can be basic alethic/epistemic reasons for belief and basic pragmatic/non-alethic reasons for belief that can combine to determine what one ought to believe. The paper shows how this non-derivative first-order pluralism arises from a purely welfarist account of the foundations of theoretical normativity, thereby combining foundational pragmatism with non-derivative pluralism about normative reasons for belief. In addition, this paper outlines how (...) welfarist pluralism provides a new and potentialy attractive account of the value of truth (or its indicators), namely that the value of truth (or its indicators) is its direct contribution to individuals' personal good or wellbeing. (shrink)

Anti-exceptionalists about formal logic think that logic is continuous with the sciences. Many philosophers of science think that there is feminist science. Putting these together: can anti-exceptionalism make space for feminist logic? The answer depends on the details of the ways logic is like science and the ways science can be feminist. This paper wades into these details, examines five different approaches, and ultimately argues that anti-exceptionalism makes space for feminist logic in several different ways.

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)

Minimalism about truth is one of the main contenders for our best theory of truth, but minimalists face the charge of being unable to properly state their theory. Donald Davidson incisively pointed out that minimalists must generalize over occurrences of the same expression placed in two different contexts, which is futile. In order to meet the challenge, Paul Horwich argues that one can nevertheless characterize the axioms of the minimalist theory. Sten Lindström and Tim Button have independently argued that Horwich’s (...) attempt to formulate minimalism remains unsuccessful. We show how to properly state Horwich’s axioms by appealing to propositional functions that are given by definite descriptions. Both Lindström and Button discuss proposals similar to ours and conclude that they are unsuccessful. Our new suggestion avoids these objections. (shrink)

In proof-theoretic semantics, meaning is based on inference. It may be seen as the mathematical expression of the inferentialist interpretation of logic. Much recent work has focused on base-extension semantics, in which the validity of formulas is given by an inductive definition generated by provability in a ‘base’ of atomic rules. Base-extension semantics for classical and intuitionistic propositional logic have been explored by several authors. In this paper, we develop base-extension semantics for the classical propositional modal systems K, KT , (...) K4, and S4, with □ as the primary modal operator. We establish appropriate soundness and completeness theorems and establish the duality between □ and a natural presentation of ♢. We also show that our semantics is in its current form not complete with respect to euclidean modal logics. Our formulation makes essential use of relational structures on bases. (shrink)

This paper shows that the relevant logics E and Π′ are strongly sound and complete with regards to a version of the “simplified” Routley-Meyer semantics. Such a semantics for E has been thought impossible. Although it is impossible if an admissible rule of E – the rule of restricted assertion or equivalently Ackermann’s δ-rule – is solely added as a primitiverule, it is very much possible when E is axiomatized in the way Anderson and Belnap did. The simplified semantics for (...) E and Π′ requires unreduced frames. Contra what has been claimed, however, no additional frame component is required over and above what’s required to model other relevant logics such as T and R. It is also shown how to modify the tonicity requirements of theternary relation so as to allow for the standard truth condition for both fusion – the intensional conjunction◦ – as well as the converse conditional ←. (shrink)

It is shown how to model propositional constants within the simplified Routley-Meyer semantics. Various axioms and rules allowingthe definition of modal operators, implicative negations, enthymematical conditionals, and propositions expressing various infinite conjunctions anddisjunctions are set forth and shown to correspond to specific frame conditions. Two propositional constants which are both often designated as “the Ackermann constant” are shown to capture two such “infinite” propositions: The conjunction of every logical law and the conjunction of every truth – what Anderson and Belnap (...) called the “world” constant. (shrink)