#### 330 Citations

Checking Deadlock-Freedom of Parametric Component-Based Systems

- Computer Science
- TACAS
- 2019

The paper presents the theoretical foundations of the method, including new results for the first order monadic logic and proves its soundness, and reports on a preliminary experimental evaluation on several textbook examples. Expand

On the uniform one-dimensional fragment over ordered models

- Mathematics
- 2017

The uniform one-dimensional fragment U1 is a recently introduced extension of the two-variable fragment FO. The logic U1 enables the use of relation symbols of all arities and thereby extends the… Expand

Novel threshold concepts in the mathematical sciences

- 2012

The purpose of this research is to identify and examine some unusual, unexpected or novel threshold concepts in mathematics. This is ongoing work that contributes towards the development of a suite… Expand

FIFTY YEARS OF THE SPECTRUM PROBLEM: SURVEY AND NEW RESULTS

- 2011

In 1952, Heinrich Scholz published a question in the Journal of Symbolic Logic asking for a characterization of spectra, i.e., sets of natural numbers that are the cardinalities of finite models of… Expand

Decidability vs. undecidability. Logico-philosophico-historical remarks

- Computer Science
- Ann. UMCS Informatica
- 2005

The aim of the paper is to present the decidability problems from a philosophical and historical perspective as well as to indicate basic mathematical and logical results concerning (un)decidability… Expand

Model Theory ( Draft 20 Jul 00 )

- 2000

In 1954 Alfred Tarski [210] announced that ‘a new branch of metamathematics’ had appeared under the name of the theory of models. The subject grew fast: the Omega Group bibliography of model theory… Expand

Fifty years of the spectrum problem: survey and new results

- Mathematics, Computer Science
- Bull. Symb. Log.
- 2012

The present disclosure involves a method of identifying animals involving the use of a universal identification scheme capable of identifying individual animals anywhere in the world such that data… Expand

How Peircean was the “‘Fregean’ revolution” in logic?

- Mathematics
- 2012

The historiography of logic conceives of a Fregean revolution in which modern mathematical logic (also called symbolic logic) has replaced Aristotelian logic. The preeminent expositors of this… Expand

REREADING TARSKI ON LOGICAL CONSEQUENCE

- Computer Science, Philosophy
- The Review of Symbolic Logic
- 2009

It is argued that recent defenses of the view that in 1936 Tarski required all interpretations of a language to share one same domain of quantification are based on misinterpretations of Tarskian proof and a more detailed report of the textual evidence is offered. Expand

Algorithmic properties of first-order modal logics of linear Kripke frames in restricted languages

- Computer Science
- ArXiv
- 2021

It is shown that the logics of frames based on N are Π1-hard—thus, not recursively enumerable—in languages with two individual variables, one monadic predicate letter and one proposition letter. Expand