中文
相关论文

相关论文: A Revision Theoretic Model for NF

200 篇论文

This paper deals with belief base revision that is a form of belief change consisting of the incorporation of new facts into an agent's beliefs represented by a finite set of propositional formulas. In the aim to guarantee more reliability…

人工智能 · 计算机科学 2020-09-25 Raïda Ktari , Mohamed Ayman Boujelben

This paper is concerned with the question of when a theory is refutable with certainty on the basis of sequence of primitive observations. Beginning with the simple definition of falsifiability as the ability to be refuted by some finite…

逻辑 · 数学 2022-09-27 Reid Dale

In this paper, we unify the study of classical and non-classical algebra-valued models of set theory, by studying variations of the interpretation functions for identity and set-membership. Although, these variations coincide with the…

逻辑 · 数学 2024-02-02 Santiago Jockwich , Sourav Tarafder , Giorgio Venturi

There are two methods to study families of conformal theories in the operator formalism. In the first method we begin with a theory and a family of deformed theories is defined in the state space of the original theory. In the other there…

高能物理 - 理论 · 物理学 2009-10-22 K. Ranganathan

We observe that the notion of two sets being equal up to finitely many elements is a homotopy equivalence relation in a model category, and suggest a homotopy-invariant variant of Generalised Continuum Hypothesis about which more can be…

范畴论 · 数学 2010-06-25 Misha Gavrilovich

We propose a new paradigm for Belief Change in which the new information is represented as sets of models, while the agent's body of knowledge is represented as a finite set of formulae, that is, a finite base. The focus on finiteness is…

计算机科学中的逻辑 · 计算机科学 2023-09-13 Ricardo Guimarães , Ana Ozaki , Jandson S. Ribeiro

We present the formalization of a theory of syntax with bindings that has been developed and refined over the last decade to support several large formalization efforts. Terms are defined for an arbitrary number of constructors of varying…

计算机科学中的逻辑 · 计算机科学 2017-07-04 Lorenzo Gheri , Andrei Popescu

A folk theorem says higher order arithmetic has the proof theoretic strength of set theory with limited power set. This paper makes the theorem precise in terms of several axiom system based on ZF.

逻辑 · 数学 2013-02-18 Colin McLarty

We introduce and study some variants of a notion of canonical set theoretical truth. By this, we mean truth in a transitive proper class model $M$ of ZFC that is uniquely characterized by some $\in$-formula. We show that there are…

逻辑 · 数学 2026-05-19 Merlin Carl , Philipp Schlicht

Distributed representations of words have been shown to capture lexical semantics, as demonstrated by their effectiveness in word similarity and analogical relation tasks. But, these tasks only evaluate lexical semantics indirectly. In this…

计算与语言 · 计算机科学 2016-12-02 Thanapon Noraset , Chen Liang , Larry Birnbaum , Doug Downey

The proof of the relative consistency of the axiom of choice has been mechanized using Isabelle/ZF. The proof builds upon a previous mechanization of the reflection theorem. The heavy reliance on metatheory in the original proof makes the…

计算机科学中的逻辑 · 计算机科学 2021-04-27 Lawrence C. Paulson

The IFF approach for the notion of "lattice of theories" uses the idea of a concept lattice from Formal Concept Analysis (Ganter and Wille) and the idea of the truth classification from Information Flow (Barwise and Seligman). The IFF…

计算机科学中的逻辑 · 计算机科学 2018-11-06 Robert E. Kent

Present day quantum field theory (QFT) is founded on canonical quantization, which has served quite well, but also has led to several issues. The free field describing a free particle (with no interaction term) can suddenly become…

综合物理 · 物理学 2021-08-13 John R. Klauder

Supervaluational fixed-point theories of formal truth aim to amend an important shortcoming of fixed-point theories based on the Strong Kleene logic, namely, accounting for the truth of classical validities. In a celebrated paper, Andrea…

逻辑 · 数学 2024-10-17 Pablo Dopico , Daichi Hayashi

Truth refers to the satisfaction relation used to define the semantics of model-theoretic languages. The satisfaction relation for first order languages (truth classification), and the preservation of truth by first order interpretations…

计算机科学中的逻辑 · 计算机科学 2024-04-24 Robert E. Kent

Nowadays, topic classification from tweets attracts considerable research attention. Different classification systems have been suggested thanks to these research efforts. Nevertheless, they face major challenges owing to low performance…

计算与语言 · 计算机科学 2024-07-04 Kheir Eddine Daouadi , Yaakoub Boualleg , Oussama Guehairia

Recent work has suggested that language models (LMs) store both common-sense and factual knowledge learned from pre-training data. In this paper, we leverage this implicit knowledge to create an effective end-to-end fact checker using a…

计算与语言 · 计算机科学 2020-07-27 Nayeon Lee , Belinda Z. Li , Sinong Wang , Wen-tau Yih , Hao Ma , Madian Khabsa

This work proposes Recurrent Neural Network (RNN) models to predict structured 'image situations' -- actions and noun entities fulfilling semantic roles related to the action. In contrast to prior work relying on Conditional Random Fields…

计算机视觉与模式识别 · 计算机科学 2017-08-07 Arun Mallya , Svetlana Lazebnik

This paper presents a new system of logic, LF, that is intended to be used as the foundation of the formalization of science. That is, deductive validity according to LF is to be used as the criterion for assessing what follows from the…

逻辑 · 数学 2024-01-23 Zachary Goodsell , Juhani Yli-Vakkuri

Explanations of neural models aim to reveal a model's decision-making process for its predictions. However, recent work shows that current methods giving explanations such as saliency maps or counterfactuals can be misleading, as they are…