中文
相关论文

相关论文: E. Specker: "The logic of non-simultaneously decid…

200 篇论文

No abstract given. Contents: I. Definition and Introduction II. Schelling Model III. Opinion Dynamics IV. Languages, Hierarchies and Football V. Future Directions

物理与社会 · 物理学 2007-05-23 D. Stauffer

We give an introduction to the ideas behind G. S. Tseytin's 1958 construction of a seven-relation semigroup with undecidable word problem. We give a history of the ideas leading up to its construction, some intuition for the proof, and…

历史与综述 · 数学 2024-01-23 Carl-Fredrik Nyberg-Brodda

This text highlights issues present in the proof of Lemma 6.10 of the Baumgartner (1943 -- 2011) article "Almost disjoint sets, the dense set problem and the partition calculus" of 1976, and intends to present a correction at the same time…

逻辑 · 数学 2026-03-26 Júnio Luan Pereira

This paper presents a novel concept of a Polyatomic Logic and initiates its systematic study. This approach, inspired by Inquisitive semantics, is obtained by taking a variant of a given logic, obtained by looking at the fragment covered by…

逻辑 · 数学 2023-03-28 Rodrigo Nicolau Almeida

This is a translation of Kronecker's "\"Uber die Gleichungen f\"unften Grades" (On equations of fifth degree), excerpted from the monthly report to the Berlin Academy of Sciences from June 1861.

代数几何 · 数学 2021-08-11 Yonathan Stone

The Halting Problem is a version of the Liar's Paradox.

计算机科学中的逻辑 · 计算机科学 2016-06-29 Eric C. R. Hehner

The computability power of a distributed computing model is determined by the communication media available to the processes, the timing assumptions about processes and communication, and the nature of failures that processes can suffer. In…

分布式、并行与集群计算 · 计算机科学 2017-04-27 Eric Goubault , Sergio Rajsbaum

This paper presents an extension of temporal epistemic logic with operators that quantify over agent strategies. Unlike previous work on alternating temporal epistemic logic, the semantics works with systems whose states explicitly encode…

计算机科学中的逻辑 · 计算机科学 2018-07-13 Xiaowei Huang , Ron van der Meyden

In this article, we study translations between variants of defaults logics such that the extensions of the theories that are the input and the output of the translation are in a bijective correspondence. We assume that a translation can…

人工智能 · 计算机科学 2021-04-12 Paolo Liberatore

Any class of languages $\mathbf{L}$ accepted in time $\mathbf{T}$ has a counterpart $\mathbf{NL}$ accepted in nondeterministic time $\mathbf{NT}$. It follows from the definition of nondeterministic languages that $\mathbf{L} \subseteq…

形式语言与自动机理论 · 计算机科学 2021-11-30 Martin Kolář

A comment on "Neurophysiological dynamics of phrase-structure building during sentence processing" by Nelson et al (2017), Proceedings of the National Academy of Sciences USA 114(18), E3669-E3678.

计算与语言 · 计算机科学 2020-09-24 Xinying Chen , Carlos Gómez-Rodríguez , Ramon Ferrer-i-Cancho

We extend the epistemic logic with De Morgan negation by Fagin et al. (Artif. Intell. 79, 203-240, 1995) by adding operators for universal and common knowledge in a group of agents, and with a formalization of information update using a…

计算机科学中的逻辑 · 计算机科学 2019-09-26 Igor Sedlár , Vít Punčochář , Andrew Tedder

Defeasible logic is a rule-based nonmonotonic logic, with both strict and defeasible rules, and a priority relation on rules. We show that inference in the propositional form of the logic can be performed in linear time. This contrasts…

人工智能 · 计算机科学 2009-09-29 Michael J. Maher

This is an English translation of the following paper, published several years ago: Nikonorov Yu.G., Nikonorova Yu.V. Generalized Popoviciu's problem (Russian), Tr. Rubtsovsk. Ind. Inst., 7, 229-232 (2000), Zbl. 0958.51021. All inserted…

历史与综述 · 数学 2018-06-12 Yu. G. Nikonorov , Yu. V. Nikonorova

The problem of giving a computational meaning to classical reasoning lies at the heart of logic. This article surveys three famous solutions to this problem - the epsilon calculus, modified realizability and the dialectica interpretation -…

计算机科学中的逻辑 · 计算机科学 2018-12-17 Thomas Powell

We describe a graph-theoretic syntax for self-referential formulas as well as a four-valued logic to include contradictory and independent formulas. We then explore the degree to which generalized truth tables can be realized in our theory,…

逻辑 · 数学 2007-05-23 Dan Seabold , Stefan Waner , Steve Warner

This paper treat determinacy of strong moment problems in part I and indeterminacy of strong moment problems in part II. This paper is a summary of the following papers: [1] Ald\'en. E., Determinacy of Strong Moment Problems. [2] On…

经典分析与常微分方程 · 数学 2016-04-22 Erik Aldén

The paper consists of two parts. The first part is devoted to logic for universal algebraic geometry. The second one deals with problems and some results. It may be regarded as a brief exposition of some ideas from the book in progress:…

群论 · 数学 2012-06-05 Boris Plotkin

Translations between different nonmonotonic formalisms always have been an important topic in the field, in particular to understand the knowledge-representation capabilities those formalisms offer. We provide such an investigation in terms…

人工智能 · 计算机科学 2014-01-17 Wolfgang Dvorak , Stefan Woltran

A translation and discussion of G. Luders, Ann. Phys. (Leipzig) 8 322-328 (1951).

量子物理 · 物理学 2007-05-23 K. A. Kirkpatrick