English
Related papers

Related papers: Constructive truth and circularity

200 papers

We introduce a logical framework for reasoning about "uncertain interpretations" and investigate two key applications: a new semantics for implication capturing a kind of "meaning entailment", and a conservative notion of "evidentially…

Logic in Computer Science · Computer Science 2025-03-21 Adam Bjorndahl

We present constructive provability logic, an intuitionstic modal logic that validates the L\"ob rule of G\"odel and L\"ob's provability logic by permitting logical reflection over provability. Two distinct variants of this logic, CPL and…

Logic in Computer Science · Computer Science 2012-05-30 Robert J. Simmons , Bernardo Toninho

Abstract axiomatic formulation of mathematical structures are extensively used to describe our physical world. We take here the reverse way. By making basic assumptions as starting point, we reconstruct some features of both geometry and…

History and Overview · Mathematics 2021-02-12 B. F. Rizzuti , L. M. Gaio , C. Duarte

The paper aims at emphasizing that, even relaxed, the hypothesis of compositionality has to face many problems when used for interpreting natural language texts. Rather than fixing these problems within the compositional framework, we…

Computation and Language · Computer Science 2007-05-23 Françoise Gayral , Daniel Kayser , François Lévy

Research in information systems includes a wide range of approaches which make a contribution in terms of knowledge, understanding, or practical developments. The measure of any research is, ultimately, its validity: are its finding true,…

Computers and Society · Computer Science 2017-01-18 John Mingers , Craig Standing

An analysis using classical stochastic processes is used to construct a consistent system of quantum counterfactual reasoning. When applied to a counterfactual version of Hardy's paradox, it shows that the probabilistic character of quantum…

Quantum Physics · Physics 2009-10-31 Robert B. Griffiths

We present a new method for characterizing the interpretive possibilities generated by elliptical constructions in natural language. Unlike previous analyses, which postulate ambiguity of interpretation or derivation in the full clause…

cmp-lg · Computer Science 2016-08-31 Mary Dalrymple , Stuart M. Shieber , Fernando C. N. Pereira

This paper develops a technical and practical reinterpretation of the real interval [a,b] under the paradigm of fractal countability. Instead of assuming the continuum as a completed uncountable totality, we model [a,b] as a layered…

Logic in Computer Science · Computer Science 2025-05-21 Stanislav Semenov

We present a family of paraconsistent counterparts of the constructive modal logic CK. These logics aim to formalise reasoning about contradictory but non-trivial propositional attitudes like beliefs or obligations. We define their…

Logic in Computer Science · Computer Science 2025-08-26 Han Gao , Daniil Kozhemiachenko , Nicola Olivetti

All constructive methods employed in modern mathematics produce only countable sets, even when designed to transcend countability. We show that any constructive argument for uncountability -- excluding diagonalization techniques --…

General Mathematics · Mathematics 2025-05-28 Stanislav Semenov

We present a propositional logic with fundamental probabilistic semantics, in which each formula is given a real measure in the interval $[0,1]$ that represents its degree of truth. This semantics replaces the binarity of classical logic,…

Logic in Computer Science · Computer Science 2025-05-22 Francisco Aragão

Debates concerning philosophical grounds for the validity of classical and intuitionistic logics often have the very nature of logical proofs as one of the main points of controversy. The intuitionist advocates for a strict notion of…

Logic in Computer Science · Computer Science 2025-04-07 Victor Nascimento , Luiz Carlos Pereira , Elaine Pimentel

We prove a theorem stating that any semantics can be encoded as a compositional semantics, which means that, essentially, the standard definition of compositionality is formally vacuous. We then show that when compositional semantics is…

cmp-lg · Computer Science 2008-02-03 Wlodek Zadrozny

Computability logic (CL) (see http://www.cis.upenn.edu/~giorgi/cl.html) is a recently launched program for redeveloping logic as a formal theory of computability, as opposed to the formal theory of truth that logic has more traditionally…

Logic in Computer Science · Computer Science 2011-04-15 Giorgi Japaridze

We present a comprehensive survey of constructions of the real numbers (from either the rationals or the integers) in a unified fashion, thus providing an overview of most (if not all) known constructions ranging from the earliest attempts…

History and Overview · Mathematics 2015-06-12 Ittay Weiss

This paper provides a fresh perspective on the representation of distributive bilattices and of related varieties. The techniques of naturalduality are employed to give, economically and in a uniform way, categories ofstructures dually…

Rings and Algebras · Mathematics 2014-01-16 L. M. Cabrer , H. A. Priestley

This article supports the epistemological claim that sound human reasoning about ultimate knowledge is either foundational or circularly justified. In particular, questions which naturally arise in theology, philosophy, and related…

History and Overview · Mathematics 2025-08-29 Chad R. Mangum

Ensuring a faithful interaction with data and its representation for humanities can and should depend on expert-constructed ground truths.

Digital Libraries · Computer Science 2021-03-25 Yvette Oortwijn , Hein van den Berg , Arianna Betti

Motivated by several classic decision-theoretic paradoxes, and by analogies with the paradoxes which in physics motivated the development of quantum mechanics, we introduce a projective generalization of expected utility along the lines of…

Quantum Physics · Physics 2024-01-18 Pierfrancesco La Mura

We explore the theory of illfounded and cyclic proofs for the propositional modal $\mu$-calculus. A fine analysis of provability for classical and intuitionistic modal logic provides a novel bridge between finitary, cyclic and illfounded…

Logic · Mathematics 2025-09-03 Bahareh Afshari , Graham E. Leigh , Guillermo Menèndez Turata
‹ Prev 1 3 4 5 6 7 10 Next ›