Contribution of Warsaw logicians to computational logic (Q2422533): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5824357 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5720193 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nicht konstruktiv beweisbare Sätze der Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tarski's influence on computer science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5734410 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic properties of structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5596237 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5626601 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4133962 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4109270 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3792662 / rank
 
Normal rank
Property / cites work
 
Property / cites work: LOGLAN '88. Report on the programming language / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4525781 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some relationships between logics of programs and complexity theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4227581 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4744245 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability of Second-Order Theories and Automata on Infinite Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completeness of Kozen's axiomatisation of the propositional \(\mu\)-calculus. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monadic second-order logic on tree-like structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5771193 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The undecidability of the semi-unification problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lectures on the Curry-Howard isomorphism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rough sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3509166 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Collapsing modular counting in bounded arithmetic and constant depth propositional proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4738227 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Science Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2904801 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4601873 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Decidability of MSO+U on Infinite Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3509159 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards nominal computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Turing machines with atoms, constraint satisfaction problems, and descriptive complexity / rank
 
Normal rank

Latest revision as of 14:59, 19 July 2024

scientific article
Language Label Description Also known as
English
Contribution of Warsaw logicians to computational logic
scientific article

    Statements

    Contribution of Warsaw logicians to computational logic (English)
    0 references
    0 references
    0 references
    19 June 2019
    0 references
    Summary: The newly emerging branch of research of Computer Science received encouragement from the successors of the Warsaw mathematical school: Kuratowski, Mazur, Mostowski, Grzegorczyk, and Rasiowa. Rasiowa realized very early that the spectrum of computer programs should be incorporated into the realm of mathematical logic in order to make a rigorous treatment of program correctness. This gave rise to the concept of algorithmic logic developed since the 1970s by Rasiowa, Salwicki, Mirkowska, and their followers. Together with Pratt's dynamic logic, algorithmic logic evolved into a mainstream branch of research: logic of programs. In the late 1980s, Warsaw logicians Tiuryn and Urzyczyn categorized various logics of programs, depending on the class of programs involved. Quite unexpectedly, they discovered that some persistent open questions about the expressive power of logics are equivalent to famous open problems in complexity theory. This, along with parallel discoveries by Harel, Immerman and Vardi, contributed to the creation of an important area of theoretical computer science: descriptive complexity. By that time, the modal \(\mu\)-calculus was recognized as a sort of a universal logic of programs. The mid 1990s saw a landmark result by Walukiewicz, who showed completeness of a natural axiomatization for the \(\mu\)-calculus proposed by Kozen. The difficult proof of this result, based on automata theory, opened a path to further investigations. Later, Bojanczyk opened a new chapter by introducing an unboundedness quantifier, which allowed for expressing some quantitative properties of programs. Yet another topic, linking the past with the future, is the subject of automata founded in the Fraenkel-Mostowski set theory. The studies on intuitionism found their continuation in the studies of Curry-Howard isomorphism. Łukasiewicz's landmark idea of many-valued logic found its continuation in various approaches to incompleteness and uncertainty.
    0 references
    0 references
    0 references
    0 references
    0 references
    algorithmic logic
    0 references
    dynamic logic
    0 references
    \(\mu\)-calculus
    0 references
    \(\lambda\)-calculus
    0 references
    0 references
    0 references