English
Related papers

Related papers: E. Specker: "The logic of non-simultaneously decid…

200 papers

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

Physics and Society · Physics 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…

History and Overview · Mathematics 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…

Logic · Mathematics 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…

Logic · Mathematics 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.

Algebraic Geometry · Mathematics 2021-08-11 Yonathan Stone

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

Logic in Computer Science · Computer Science 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…

Distributed, Parallel, and Cluster Computing · Computer Science 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…

Logic in Computer Science · Computer Science 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…

Artificial Intelligence · Computer Science 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…

Formal Languages and Automata Theory · Computer Science 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.

Computation and Language · Computer Science 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…

Logic in Computer Science · Computer Science 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…

Artificial Intelligence · Computer Science 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…

History and Overview · Mathematics 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 -…

Logic in Computer Science · Computer Science 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,…

Logic · Mathematics 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…

Classical Analysis and ODEs · Mathematics 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:…

Group Theory · Mathematics 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…

Artificial Intelligence · Computer Science 2014-01-17 Wolfgang Dvorak , Stefan Woltran

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

Quantum Physics · Physics 2007-05-23 K. A. Kirkpatrick