相关论文: A Naive Encoding of Russell's Paradox in Type Theo…

The inconsistencies involved in the foundation of set theory were invariably caused by infinity and self-reference; and only with the opportune axiomatic restrictions could them be obviated. Throughout history, both concepts have proved to…

If a quantum system is prepared and later post-selected in certain states, "paradoxical" predictions for intermediate measurements can be obtained. This is the case both when the intermediate measurement is strong, i.e. a projective…

Text entailment, the task of determining whether a piece of text logically follows from another piece of text, is a key component in NLP, providing input for many semantic applications such as question answering, text summarization,…

This paper presents an approach to Prolog-style term encoding of typed feature structures. The type feature structures to be encoded are constrained by appropriateness conditions as in Carpenter's ALE system. But unlike ALE, we impose a…

Riddles are concise linguistic puzzles that describe an object or idea through indirect, figurative, or playful clues. They are a longstanding form of creative expression, requiring the solver to interpret hints, recognize patterns, and…

Working with the simple types over a base type of natural numbers (including product types), we consider the question of when a type $\sigma$ is encodable as a definable retract of $\tau$: that is, when there are $\lambda$-terms…

We suggest a forcing version of Yablo's paradox and discuss its implication on self-reference.

In the normal presentation of the EPR problem a comparison is made between the (weak) Copenhagen interpretation of quantum mechanics which seems to suggest that at times action at a distance may take place, and the hidden parameter…

A wide range of intuitionistic type theories may be presented as equational theories within a logical framework. This method was formulated by Per Martin-L\"{o}f in the mid-1980's and further developed by Uemura, who used it to prove an…

We present a new coherence theorem for comprehension categories, providing strict models of dependent type theory with all standard constructors, including dependent products, dependent sums, identity types, and other inductive types.…

A set is nontypical in the Russell sense, if it belongs to a countable ordinal definable set. The class HNT of all hereditarily nontypical sets satisfies all axioms of ZF and the double inclusion HOD $\subseteq$ HNT $\subseteq$ V holds.…

We provide a simple proof of a computable analogue to the Jayne Rogers Theorem from descriptive set theory. The difficulty of the proof is delegated to a simulation result pertaining to non-deterministic type-2 machines. Thus, we…

In most text books on number theory Wilson Theorem is proved by applying Lagrange theorem concerning polynomial congruences.Hardy and Wright also give a proof using cuadratic residues. In this article Wilson theorem is derived as a…

An approach for encoding abstract dialectical frameworks and their semantics into classical higher-order logic is presented. Important properties and semantic relationships are formally encoded and proven using the proof assistant…

I'll discuss how Goedel's paradox "This statement is false/unprovable" yields his famous result on the limits of axiomatic reasoning. I'll contrast that with my work, which is based on the paradox of "The first uninteresting positive whole…

At the heart of intuitionistic type theory lies an intuitive semantics called the "meaning explanations"; crucially, when meaning explanations are taken as definitive for type theory, the core notion is no longer "proof" but "verification".…

A type theory is presented that combines (intuitionistic) linear types with type dependency, thus properly generalising both intuitionistic dependent type theory and full linear logic. A syntax and complete categorical semantics are…

The compactness phenomenon is one of the featured aspects of structuralism in mathematics. In simple and broad words, a compactness property holds in a structure if a related property is satisfied by sufficiently many substructures of that…

We provide a version of first-order hybrid tense logic with predicate abstracts and definite descriptions as the only non-rigid terms. It is formalised by means of a tableau calculus working on sat-formulas. A particular theory of DD…

This paper gives a counterexample to the impossibility, by G\"odel's second incompleteness theorem, of proving a formula expressing the consistency of arithmetic in a fragment of arithmetic on the assumption that the latter is consistent.…