Among our conscious states are conscious thoughts. The question at the center of the recent growing literature on cognitive phenomenology is this: In consciously thinking P, is there thereby any phenomenology—is there something it’s like? One way of clarifying the question is to say that it concerns whether there is any proprietary phenomenology associated with conscious thought. Is there any phenomenology due to thinking, as opposed to phenomenology that is due to some co-occurring sensation or mental image? In this paper (...) we will present two arguments that a “yes” answer to this question of cognitive phenomenology can be obtained via appeal to the HOT theory of consciousness, especially the version articulated and defended by David Rosenthal. (shrink)

Because formal systems of symbolic logic inherently express and represent the deductive inference model formal proofs to theorem consequences can be understood to represent sound deductive inference to true conclusions without any need for other representations such as model theory.

I here present some doubts about whether Mandik’s (2010) proposed intermediacy and recurrence constraints are necessary and sufficient for agentive experience. I also argue that in order to vindicate the conclusion that agentive experience is an exclusively perceptual phenomenon (Prinz, 2007), it is not enough to show that the predictions produced by forward models of planned motor actions are conveyed by mock sensory signals. Rather, it must also be shown that the outputs of “comparator” mechanisms that compare these predictions (...) against actual sensory feedback are also coded in a perceptual representational format. (shrink)

This is the formal YACC BNF specification for Minimal Type Theory (MTT). MTT was created by augmenting the syntax of First Order Logic (FOL) to specify Higher Order Logic (HOL) expressions using FOL syntax. Syntax is provided to enable quantifiers to specify type. FOL is a subset of MTT. The ASSIGN_ALIAS operator := enables FOL expressions to be chained together to form HOL expressions.

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.

Because formal systems of symbolic logic inherently express and represent the deductive inference model formal proofs to theorem consequences can be understood to represent sound deductive inference to deductive conclusions without any need for other representations.

The object of realist metaphysics is generally thought to be to describe the structure of the world as it is in itself, or, alternatively, to determine precisely what is real. The purpose of this essay is to suggest that, although there have been many attempts to achieve this goal, they all fall down, not simply because they have misconstrued the nature of the in-itself or precisely what is real, but because, more fundamentally, they are not clear about what it is (...) to talk about the in-itself or the real. In short, contemporary realism, both continental and analytic, does not have an adequate concept of reality. (shrink)

If the conclusion of the Tarski Undefinability Theorem was that some artificially constrained limited notions of a formal system necessarily have undecidable sentences, then Tarski made no mistake within his assumptions. When we expand the scope of his investigation to other notions of formal systems we reach an entirely different conclusion showing that Tarski's assumptions were wrong.

This paper decomposes the Liar Paradox into its semantic atoms using Meaning Postulates (1952) provided by Rudolf Carnap. Formalizing truth values of propositions as Boolean properties of these propositions is a key new insight. This new insight divides the translation of a declarative sentence into its equivalent mathematical proposition into three separate steps. When each of these steps are separately examined the logical error of the Liar Paradox is unequivocally shown.

For any natural (human) or formal (mathematical) language L we know that an expression X of language L is true if and only if there are expressions Γ of language L that connect X to known facts. -/- 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 evaluate to neither True nor False.

Within the (Haskell Curry) notion of a formal system we complete Tarski's formal correctness: ∀x True(x) ↔ ⊢ x and use this finally formalized notion of Truth to refute his own Undefinability Theorem (based on the Liar Paradox), the Liar Paradox, and the (Panu Raatikainen) essence of the conclusion of the 1931 Incompleteness Theorem.

Hypothesis: WFF(x) can be applied syntactically to the semantics of formalized declarative sentences such that: WFF(x) ↔ (x ↦ True) ∨ (x ↦ False) (see proof sketch below) For clarity we focus on simple propositions without binary logical connectives.

Tarski "proved" that there cannot possibly be any correct formalization of the notion of truth entirely on the basis of an insufficiently expressive formal system that was incapable of recognizing and rejecting semantically incorrect expressions of language. -/- An alternative that corrects the shortcomings of the conventional notion of formal systems is provided that totally eliminates incompleteness and undecidability from all formal systems capable of directly expressing a provability predicate (thus without diagonalization).

The generalized conclusion of the Tarski and Gödel proofs: All formal systems of greater expressive power than arithmetic necessarily have undecidable sentences. Is not the immutable truth that Tarski made it out to be it is only based on his starting assumptions. -/- When we reexamine these starting assumptions from the perspective of the philosophy of logic we find that there are alternative ways that formal systems can be defined that make undecidability inexpressible in all of these formal systems.

Minimal Type Theory (MTT) shows exactly how all of the constituent parts of an expression relate to each other (in 2D space) when this expression is formalized using a directed acyclic graph (DAG). This provides substantially greater expressiveness than the 1D space of FOPL syntax. -/- The increase in expressiveness over other formal systems of logic shows the Pathological Self-Reference Error of expressions previously considered to be sentences of formal systems. MTT shows that these expressions were never truth bearers, thus (...) never sentences of any formal logic system. (shrink)

If there truly is a proof that shows that no universal halt decider exists on the basis that certain tuples: (H, Wm, W) are undecidable, then this very same proof (implemented as a Turing machine) could be used by H to reject some of its inputs. When-so-ever the hypothetical halt decider cannot derive a formal proof from its input strings and initial state to final states corresponding the mathematical logic functions of Halts(Wm, W) or Loops(Wm, W), halting undecidability has been (...) decided. (shrink)

When we understand that every potential halt decider must derive a formal mathematical proof from its inputs to its final states previously undiscovered semantic details emerge. -/- When-so-ever the potential halt decider cannot derive a formal proof from its input strings to its final states of Halts or Loops, undecidability has been decided. -/- The formal proof involves tracing the sequence of state transitions of the input TMD as syntactic logical consequence inference steps in the formal language of Turing Machine (...) Descriptions. (shrink)

We begin with the hypothetical assumption that Tarski’s 1933 formula ∀ True(x) φ(x) has been defined such that ∀x Tarski:True(x) ↔ Boolean-True. On the basis of this logical premise we formalize the Truth Teller Paradox: "This sentence is true." showing syntactically how self-reference paradox is semantically ungrounded.

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)