Информационная система "Конференции"

List reports

Number of reports: 92

[1]

[41]

[81]

1. Alaev P.E. Computable Boolean algebras

2. Arai T. Some results in the epsilon substitution method

3. Arbiser A. Abstract rewriting systems and subsystems: understanding subcalculi and strategies

4. Ardeshir M. Basic Arithmetics

5. Ashaev I.V. Graph Theorem for Computability over Algebraic Structures

6. Babyonyshev S.V. Another characterization of Deduction-Detachment theorem

7. Badaev S.A., Talasbaeva Zh.T. Computability in the Ershov Hierarchy

8. Baizhanov B.S. Expansions of models of stable theories and weakly benign property.

9. Beklemishev L.D. On limit existence principles in formal arithmetic.

10. Beliakin N. One $omega$-inconsistent formalization of set theory

11. Choe K.-M., Eo H., O S., Shilov N.V., Yi K. Proofs about folklore: why model checking = reachability?

12. Costa-Leita A. Paraconsistentization of logics

13. Curien P. Sequential algorithms as bistable maps

14. Davydov A.V. Development and applications of calculation of positive-constructed formulas

15. Demenkov P.S., Y. Kharlamov E.Y. Discrete modeling of structure preserving mutations in proteins.

16. Dimitracopaulos C, Sirokofskich A.I. On a problem of L.D. Beklemishev

17. Djelloul K. , Colmerauer A. Combination of Trees and Additive Real numbers in a Complete First-Order Theory.

18. Dobritsa V.P. Work Neural Sistems from point of view fazzy vektors (abstract in russian)

19. Ershov Y.L. Model-theoretical properties of multi-valued fields.

20. Gao S. Unitary group actions and classification problems

21. Gavryushkin A.N. The Complexity of Ehrenfeucht Models ()

22. Gencer C. Basis For Passive Inference Rules In The Modal Logic K 4

23. Glushkova V.N. The Computable Sigma-Specifications of Hierarchical Kripke Worlds

24. Hausser R.R. Comparing Left-Associative Grammar with PSG

25. Hirschfeldt Denis R. , Khoussainov B., Semukhin P.M. An uncountably categorical theory whose only computably presentable model is saturated

26. Hoang C. Truth & Proof in Arithmetic

27. Jain S., Kinber E. Negative Data in Learning Languages

28. Juriev D.N., Postnov S.S. The non-classical three-valued logic and artificial intelligence: conjunction of deterministic and fuzzy approach.

29. Kanovei V. On two inductive Borel irreducibility theorems

30. Kazachkov I.V. Universal Theory of Free Metabelian Lie Algebra over a Finite Field ()

31. Khisamiev N. On constructive nilpotent groups.

32. Khomich V.I. The simple substitution property for superintuitionistic and modal logics

33. Khoussainov B., Slaman T., Semukhin P.M. On П⁰₁- presentations of algebras

34. Khoussainov B.M. On Finitely Presented Expansions of Algebras.

35. Korovin K., Voronkov A. Random Structures and Thresholds for Existential Fragment of First-Order Logic

36. Korovina M., N.Vorobjov Pfaffian hybrid systems

37. Kovalyov S.P. MODEL-THEORETIC METHODS OF ANALYSIS OF COMPUTER ARITHMETIC

38. Kralin S.S. Contingency in S4

39. Kucher V.A., Liakhov A.V. The methods of use Intuition calculation of utterances.

40. Kulpeshov B.Sh. On circularly ordered structures with minimality conditions

[1]

[41]

[81]

Mail to Webmaster alc9@math.nsc.ru

|Home Page| |English Part|

Go to Home