English
Related papers

Related papers: Consequences of a Goedel's misjudgment

200 papers

In his paper on the incompleteness theorems, G\"odel seemed to say that a direct way of constructing a formula that says of itself that it is unprovable might involve a faulty circularity. In this note, it is proved that 'direct'…

Logic · Mathematics 2021-06-08 Saul A. Kripke

Existing works have studied the impacts of the order of words within natural text. They usually analyze it by destroying the original order of words to create a scrambled sequence, and then comparing the models' performance between the…

Computation and Language · Computer Science 2024-03-19 Qinghua Zhao , Jiaang Li , Lei Li , Zenghui Zhou , Junfeng Liu

This is a short paper about the relationship between logic and computation. More specifically, it is about a relationship between the completeness proof for intuitionistic propositional logic within the form of proof-theoretic semantics…

Logic · Mathematics 2026-05-07 Tao Gu , David Pym , Eike Ritter , Edmund Robinson

Developing suitable formal semantics can be of great help in the understanding, design and implementation of a programming language, and act as a guide for software development tools like analyzers or partial evaluators. In this sense, full…

Logic in Computer Science · Computer Science 2010-02-16 F. J. López-Fraguas , J. Rodríguez-Hortalá

I explore the relationships between Prawitz's approach to non-monotonic proof-theoretic validity, which I call reducibility semantics, and some later proof-theoretic approaches, which I call standard base semantics and Sandqvist's base…

Logic · Mathematics 2025-06-23 Antonio Piccolomini d'Aragona

Lexical ambiguity is widespread in language, allowing for the reuse of economical word forms and therefore making language more efficient. If ambiguous words cannot be disambiguated from context, however, this gain in efficiency might make…

Computation and Language · Computer Science 2024-05-29 Tiago Pimentel , Rowan Hall Maudslay , Damián Blasi , Ryan Cotterell

This paper is an investigation of the relationship between G\"odel's second incompleteness theorem and the well-foundedness of jump hierarchies. It follows from a classic theorem of Spector's that the relation $\{(A,B) \in \mathbb{R}^2 :…

Logic · Mathematics 2021-07-27 Patrick Lutz , James Walsh

As several different formal systems with inequivalent syntax may describe equivalent semantics, it is possible to find `completions' to more expressive syntaxes that are semantically invariant. Doctrine theory, in the sense of Lawvere, is…

Category Theory · Mathematics 2023-04-18 Joshua Wrigley

Transcript of G.J. Chaitin's 2 March 2000 Carnegie Mellon University School of Computer Science Distinguished Lecture. The notion of randomness is taken from physics and applied to pure mathematics in order to shed light on the…

Chaotic Dynamics · Physics 2007-05-23 G. J. Chaitin

Some aspects of the physical nature of language are discussed. In particular, physical models of language must exist that are efficiently implementable. The existence requirement is essential because without physical models no communication…

Quantum Physics · Physics 2007-05-23 Paul Benioff

We give a proof of the inconsistency of PM arithmetic, classical set theory and related systems, incidentally exposing an error in Goedel's own proof of Goedel's Theorems. The inconsistency proof, that formulae of the form R and ~R occur as…

General Mathematics · Mathematics 2007-05-23 Dr. S. Fennell

In the paper we introduce a weak set theory $\mathsf{H}_{<\omega}$ . A formalization of arithmetic on finite von Neumann ordinals gives an embedding of arithmetical language into this theory. We show that $\mathsf{H}_{<\omega}$ proves a…

Logic · Mathematics 2019-08-29 Fedor Pakhomov

Thomason \cite{Thomason74} showed that a certain modal logic $\mathbf{L}\subset \mathbf{S4}$ is incomplete with respect to Kripke semantics. Later Gerson \cite{Gerson75} showed that $\mathbf{L}$ is also incomplete with respect to…

Logic · Mathematics 2012-02-16 Jacob Vosmaer

We revisit Levin's theory about the correspondence of verb meaning and syntax and infer semantic classes from a large syntactic classification of more than 600 German verbs taking clausal and non-finite arguments. Grasping the meaning…

Computation and Language · Computer Science 2016-06-24 Judith Eckle-Kohler

OWL 2 has been standardized by the World Wide Web Consortium (W3C) as a family of ontology languages for the Semantic Web. The most expressive of these languages is OWL 2 Full, but to date no reasoner has been implemented for this language.…

Artificial Intelligence · Computer Science 2011-08-02 Michael Schneider , Geoff Sutcliffe

The investigations on higher-order type theories and on the related notion of parametric polymorphism constitute the technical counterpart of the old foundational problem of the circularity (or impredicativity) of second and higher order…

Logic · Mathematics 2018-04-30 Paolo Pistone

Following F. William Lawvere, we show that many self-referential paradoxes, incompleteness theorems and fixed point theorems fall out of the same simple scheme. We demonstrate these similarities by showing how this simple scheme encompasses…

Logic · Mathematics 2022-05-06 Noson S. Yanofsky

Ambiguity is a natural language phenomenon occurring at different levels of syntax, semantics, and pragmatics. It is widely studied; in Psycholinguistics, for instance, we have a variety of competing studies for the human disambiguation…

Computation and Language · Computer Science 2023-11-16 Daphne Wang , Mehrnoosh Sadrzadeh

This short squib looks at how using a broader definition of G\"odel numbering to mimic the accessibility relation between possible worlds results in two-world systems that sidestep undecidable sentences as well as the Liar paradox.

Logic · Mathematics 2018-05-23 Christopher F. S. Maligec

We give a language-parametric solution to the problem of total correctness, by automatically reducing it to the problem of partial correctness, under the assumption that an expression whose value decreases with each program step in a…

Logic in Computer Science · Computer Science 2019-02-25 Andrei-Sebastian Buruiană , Ştefan Ciobâcă