The following pages link to Michał Walicki (Q409315):
Displaying 32 items.
- Expressive power of digraph solvability (Q409316) (← links)
- Finding kernels or solving SAT (Q414435) (← links)
- Kernels in digraphs that are not kernel perfect (Q442354) (← links)
- Propositional discourse logic (Q484942) (← links)
- Developing bounded reasoning (Q1006510) (← links)
- Kernels of digraphs with finitely many ends (Q1625806) (← links)
- Reference, paradoxes and truth (Q2268775) (← links)
- Quantifier-free logic for nondeterministic theories (Q2369014) (← links)
- Computation Algebras (Q2762624) (← links)
- (Q2765922) (← links)
- (Q2818800) (← links)
- (Q2844826) (← links)
- (Q3092751) (← links)
- (Q3434500) (← links)
- Completeness and Decidability in Sequence Logic (Q3498460) (← links)
- Complete Axiomatisations of Properties of Finite Sets (Q3508165) (← links)
- Strongly Complete Axiomatizations of “Knowing at Most” in Syntactic Structures (Q3623963) (← links)
- (Q3839063) (← links)
- Singular and Plural Nondeterministic Parameters (Q4376171) (← links)
- (Q4474845) (← links)
- (Q4782724) (← links)
- (Q4858905) (← links)
- Quantifier-free logic for multialgebraic theories (Q4924535) (← links)
- RESOLVING INFINITARY PARADOXES (Q4977226) (← links)
- Paraconsistent resolution (Q5039834) (← links)
- Extensions in graph normal form (Q5066802) (← links)
- Generated models and the ω-rule: The nondeterministic case (Q5096747) (← links)
- (Q5437776) (← links)
- Algebra and Coalgebra in Computer Science (Q5492835) (← links)
- Recent Trends in Algebraic Development Techniques (Q5900830) (← links)
- Paraconsistency, resolution and relevance (Q6320178) (← links)
- There are only two paradoxes (Q6450167) (← links)
