Contribution of Warsaw logicians to computational logic

DOI10.3390/axioms5020016zbMath1415.03006OpenAlexW2416992750MaRDI QIDQ2422533

Damian Niwinski

Publication date: 19 June 2019

Published in: Axioms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3390/axioms5020016

zbMATH Keywords

\(\mu\)-calculusdynamic logic\(\lambda\)-calculusalgorithmic logic

Mathematics Subject Classification ID

History of mathematics in the 20th century (01A60) History of mathematical logic and foundations (03-03) Combinatory logic and lambda calculus (03B40)

Related Items (1)

Helena Rasiowa (1917-1994) Life and Personality

Uses Software

• LOGLAN

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lectures on the Curry-Howard isomorphism
• Some relationships between logics of programs and complexity theory
• LOGLAN '88. Report on the programming language
• The undecidability of the semi-unification problem
• Monadic second-order logic on tree-like structures
• Completeness of Kozen's axiomatisation of the propositional \(\mu\)-calculus.
• Towards nominal computation
• Collapsing modular counting in bounded arithmetic and constant depth propositional proofs
• Rough sets
• Turing machines with atoms, constraint satisfaction problems, and descriptive complexity
• On the Decidability of MSO+U on Infinite Trees
• Tarski's influence on computer science
• Computer Science Logic
• Algorithmic properties of structures
• Decidability of Second-Order Theories and Automata on Infinite Trees
• Nicht konstruktiv beweisbare Sätze der Analysis

This page was built for publication: Contribution of Warsaw logicians to computational logic