The following pages link to Victor N. Krivtsov (Q708926):
Displaying 25 items.
- (Q589209) (redirect page) (← links)
- (Q1064321) (redirect page) (← links)
- An intuitionistic completeness theorem for classical predicate logic (Q708927) (← links)
- A formal system of negationless arithmetic that is conservative with respect to Heyting arithmetic (Q1064322) (← links)
- Deductive capabilities of negationless predicate calculus (Q1072539) (← links)
- One type of formal negationless systems (Q1080412) (← links)
- From Brouwerian counter examples to the creating subject (Q1288970) (← links)
- Some purely topological models for intuitionistic analysis (Q1302294) (← links)
- Note on extensions of Heyting's arithmetic by adding the ``creative subject'' (Q1306822) (← links)
- Locating the range of an operator with an adjoint (Q1397696) (← links)
- A negationless interpretation of intuitionistic theories. I (Q1577359) (← links)
- A negationless interpretation of intuitionistic theories. II (Q1582305) (← links)
- Embedding intuitionistic-type theory in negationless-type theory (Q1820157) (← links)
- A negationless interpretation of intuitionistic theories (Q1841006) (← links)
- An intuitionistic proof of Kruskal's theorem (Q1879322) (← links)
- Krivine's intuitionistic proof of classical completeness (for countable languages) (Q1887656) (← links)
- Creative subject, Beth models and neighbourhood functions (Q1908820) (← links)
- Semantical completeness of first-order predicate logic and the weak fan theorem (Q2350974) (← links)
- Some intuitionistic equivalents of classical principles for degree 2 formulas (Q2368911) (← links)
- Finiteness axioms on fragments of intuitionistic set theory (Q2425348) (← links)
- Two simple sets that are not positively Borel (Q2488272) (← links)
- The logic of a creative subject: conservativism versus intuitionistic predicate calculus (Q3125926) (← links)
- (Q3705452) (← links)
- (Q3710527) (← links)
- On the semantic completeness of the logics of the creating subject (Q4872721) (← links)
- Analyzing realizability by Troelstra's methods (Q5957857) (← links)
