The following pages link to Valery Plisko (Q234728):
Displayed 50 items.
- A semantic approach to conservativity (Q284219) (← links)
- Definability of linear orders over negative equivalences (Q321260) (← links)
- From the weak to the strong existence property (Q448335) (← links)
- Reactive intuitionistic tableaux (Q542126) (← links)
- On computable automorphisms in formal concept analysis (Q606025) (← links)
- On the contrapositive of countable choice (Q627434) (← links)
- On nested simple recursion (Q634775) (← links)
- A constructive investigation of satisfiability (Q651313) (← links)
- Computable dimensions of Pappusian and Desarguesian projective planes (Q694236) (← links)
- (Q803125) (redirect page) (← links)
- Constructive formalization of the Tennenbaum theorem and its applications (Q803126) (← links)
- Provably recursive functions of constructive and relatively constructive theories (Q964451) (← links)
- Intuitionistic logic according to Dijkstra's calculus of equational deduction (Q1049739) (← links)
- Diagnostic propositional formulas (Q1177504) (← links)
- On correlation of some concepts in the constructive model theory (Q1179647) (← links)
- On the concept of relatively uniform realizability of propositional formulas (Q1204621) (← links)
- On arithmetic complexity of certain constructive logics (Q1206242) (← links)
- Modified realizability and predicate logic (Q1274048) (← links)
- Strongly minimal theories with recursive models (Q1644487) (← links)
- Intuitionistic nonstandard bounded modified realisability and functional interpretation (Q1706266) (← links)
- A note on iterated consistency and infinite proofs (Q1734260) (← links)
- The complexity of primes in computable unique factorization domains (Q1750293) (← links)
- Hereditarily structurally complete superintuitionistic deductive systems (Q1790607) (← links)
- On logics having diagnostic formulas relative to minimal calculus (Q1908430) (← links)
- A new spectrum of computable models (Q1943912) (← links)
- L. E. J. Brouwer: Intuitionism (Q2175759) (← links)
- A refined interpretation of intuitionistic logic by means of atomic polymorphism (Q2186692) (← links)
- A model-theoretic approach to proof theory. Edited by Zofia Adamowicz, Teresa Bigorajska and Konrad Zdanowski (Q2322259) (← links)
- Gentzen's consistency proof without heightlines (Q2377348) (← links)
- Slow reflection (Q2407272) (← links)
- (Q3020318) (← links)
- SOME VARIANTS OF THE NOTION OF REALIZABILITY FOR PREDICATE FORMULAS (Q3048831) (← links)
- On Two Attempts of Describing Propositional Realizability Logic (Q3094145) (← links)
- (Q3108202) (← links)
- ABSOLUTE REALIZABILITY OF PREDICATE FORMULAS (Q3216644) (← links)
- (Q3362716) (← links)
- (Q3363696) (← links)
- (Q3363725) (← links)
- On Primitive Recursive Realizabilities (Q3434704) (← links)
- A Survey of Propositional Realizability Logic (Q3616428) (← links)
- (Q3755454) (← links)
- (Q3812244) (← links)
- (Q3819018) (← links)
- The Kolmogorov calculus as a part of minimal calculus (Q3824259) (← links)
- (Q4047525) (← links)
- (Q4052085) (← links)
- (Q4053615) (← links)
- (Q4133605) (← links)
- (Q4149444) (← links)
- THE NONARITHMETICITY OF THE CLASS OF REALIZABLE PREDICATE FORMULAS (Q4161322) (← links)