Sebastian Sequoiah-Grayson

This article mounts a defence of Floridi’s theory of strongly semantic information against recent independent objections from Fetzer and Dodig-Crnkovic. It is argued that Fetzer and Dodig-Crnkovic’s objections result from an adherence to a redundant practice of analysis. This leads them to fail to accept an informational pluralism, as stipulated by what will be referred to as Shannon’s Principle, and the non-reductionist stance. It is demonstrated that Fetzer and Dodig-Crnkovic fail to acknowledge that Floridi’s theory of strongly semantic information captures one of our deepest and most compelling intuitions regarding informativeness as a basic notion. This modal intuition will be referred to as the contingency requirement on informativeness. It will be demonstrated that its clarification validates the theory of strongly semantic information as a novel, and non ad hoc solution to the Bar-Hillel-Carnap semantic paradox.

This essay proposes a procedural interpretation of negative information in terms of split negation as procedural prohibition. Information frames and models are introduced, with negation defined as the implication of bottom, 0. A method for extracting the procedures prohibited by complex formulas is outlined, and the relationship between types of prohibited procedures is identified. Definitions of negation types in terms of the implication of 0 on an informational interpretation have been criticized. This criticism turns on the definitions creating a purportedly unnatural asymmetry between positive and negative information. It is demonstrated below that a strong asymmetry between positive and negative information is in fact the case. As such, an asymmetry between positive and negative information is natural, and something that we should want an informational interpretation of negation to preserve

This article provides the first comprehensive reconstruction and analysis of Hintikka’s attempt to obtain a measure of the information yield of deductive inferences. The reconstruction is detailed by necessity due to the originality of Hintikka’s contribution. The analysis will turn out to be destructive. It dismisses Hintikka’s distinction between surface information and depth information as being of any utility towards obtaining a measure of the information yield of deductive inferences. Hintikka is right to identify the failure of canonical information theory to give an account of the information yield of deductions as a scandal, however this article demonstrates that his attempt to provide such an account fails. It fails primarily because it applies to only a restricted set of deductions in the polyadic predicate calculus, and fails to apply at all to the deductions in the monadic predicate calculus and the propositional calculus. Some corollaries of these facts are a number of undesirable and counterintuitive results concerning the proposed relation of linguistic meaning (and hence synonymy) with surface information. Some of these results will be seen to contradict Hintikka’s stated aims, whilst others are seen to be false. The consequence is that the problem of obtaining a measure of the information yield of deductive inferences remains an open one. The failure of Hintikka’s proposal will suggest that a purely syntactic approach to the problem be abandoned in favour of an intrinsically semantic one.

K-axiom-based epistemic closure for explicit knowledge is rejected for even the most trivial cases of deductive inferential reasoning on account of the fact that the closure axiom does not extend beyond a raw consequence relation. The recognition that deductive inference concerns interaction as much as it concerns consequence allows for perspectives from logics of multi-agent information flow to be refocused onto mono-agent deductive reasoning. Instead of modeling the information flow between different agents in a communicative or announcement setting, we model the information flow between different states of a single agent as that agent reasons deductively. The resource management of the database of agent states for the deductive reasoning fragment in question is covered by the residuated structure that encodes the nonassociative Lambek Calculus with permutation, bottom, and identity: NLP01

Performing an inference involves irreducibly dynamic cognitive procedures. The article proposes that a non-associative information frame, corresponding to a residuated pogroupoid, underpins the information structure involved. The argument proceeds by expounding the informational turn in logic, before outlining the cognitive actions at work in deductive inference. The structural rules of Weakening, Contraction, Commutation, and Association are rejected on the grounds that they cause us to lose track of the information flow in inferential procedures. By taking the operation of information application as the primary operation, the fusion connective is retained, with commutative failure generating a double implication. The other connectives are rejected.