Contribution of Warsaw logicians to computational logic
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 5295807 (Why is no real title available?)
- scientific article; zbMATH DE number 5295814 (Why is no real title available?)
- scientific article; zbMATH DE number 4057487 (Why is no real title available?)
- scientific article; zbMATH DE number 3532507 (Why is no real title available?)
- scientific article; zbMATH DE number 3561326 (Why is no real title available?)
- scientific article; zbMATH DE number 1254648 (Why is no real title available?)
- scientific article; zbMATH DE number 1556014 (Why is no real title available?)
- scientific article; zbMATH DE number 6829362 (Why is no real title available?)
- scientific article; zbMATH DE number 2087432 (Why is no real title available?)
- scientific article; zbMATH DE number 3799616 (Why is no real title available?)
- scientific article; zbMATH DE number 3315203 (Why is no real title available?)
- scientific article; zbMATH DE number 3351505 (Why is no real title available?)
- scientific article; zbMATH DE number 3183995 (Why is no real title available?)
- scientific article; zbMATH DE number 3198011 (Why is no real title available?)
- scientific article; zbMATH DE number 3031479 (Why is no real title available?)
- scientific article; zbMATH DE number 3083488 (Why is no real title available?)
- Algorithmic properties of structures
- Collapsing modular counting in bounded arithmetic and constant depth propositional proofs
- Completeness of Kozen's axiomatisation of the propositional \(\mu\)-calculus.
- Computer Science Logic
- Decidability of Second-Order Theories and Automata on Infinite Trees
- LOGLAN '88. Report on the programming language
- Lectures on the Curry-Howard isomorphism
- Monadic second-order logic on tree-like structures
- Nicht konstruktiv beweisbare Sätze der Analysis
- On the decidability of MSO+U on infinite trees
- Rough sets
- Some relationships between logics of programs and complexity theory
- Tarski's influence on computer science
- The undecidability of the semi-unification problem
- Towards nominal computation
- Turing machines with atoms, constraint satisfaction problems, and descriptive complexity
- Weak \(\text{MSO}+U\) over infinite trees
Cited in
(3)
This page was built for publication: Contribution of Warsaw logicians to computational logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2422533)