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

List reports

Number of reports: 92

[1]

[41]

[81]

41. Kuznetsov A.M. Matrix modal logic

42. Kwon K. Techniques for Verifying Prolog Implementations

43. Latkin I.V. The time complexity of the bounded first-order theory

44. LEPAGE F. The functional completeness of Leśniewski’s systems

45. Lisitsa A., Potapov I. On Temporal Logic between Propositional and First-Order

46. Mantsivoda A.V. Semantic Programming for Semantic Web

47. Mardaev S.I. Graded modalities and fixed points

48. Melnikov A.G. Torsion Free Low Abelian Groups. (abstract in russian)

49. Miller J.S. The degrees of unsolvability of continuous functions

50. Morozov A.S. On definable subsets of the group Aut(Q,<).

51. Nechesov A.V. Boleon algebras and complesity-redused automata.

52. Noureddine S. A Simple Reduction Calculus for Propositional Formulas

53. Nudelman A.S. One metamathematical paradox.

54. Nurakunov A.M. On lattices of Equational Theories

55. Odintsov S., Pearce D. The Logic of Paraconsistent Answer Sets

56. Ol'khovikov G.K. New semantics for classical propositional deontic logic

57. Omarov Z.A. A criterion of n-characterisation of the variety of lattices (Omarov.ps (40kb))

58. Ono H. Interpolation Property and Principle of Variable Separation

59. Pal'chunov D. Definition of Object Domain Ontology.

60. Pal'chunov D. First-order definability in the elementary type semigroup of superatomic Boolean algebras with distinguished subalgebra.

61. Pavlovsky E.N. Estimating algorithmic complexity of classes of computable models.

62. Pinus A.G. On the implicit functions definet on different categories of finite universal algebras

63. Poplavski V. Orientation and permanent decomposition of Boolean matrices (abstract in russian)

64. Puzarenko V. Principles of Computability on Admissible Sets

65. Reibold A. Coalgebraic und category theoretical aspects of Conceptual System Theory

66. Reimann Jan, Stephan Frank On Hierarchies of Randomness Tests

67. Remeslennikov V.N. New approaches to algorithmic problems in algebra

68. Rootskey A.N. Admissible inference rules in non-linear tense logics ()

69. Rybakov V. Admissible Inference Rules in Temporal Linear Logics Based at Integer Numbers

70. Rybalov A.N. A recursive oracle for separation of P and NP over complex number field.

71. Sato M. NF: A Natural Framework for Checking Proofs

72. Schreiner P.A. Automatical Recognition of the Interpolation Property in the Extension of the S5

73. Sizikov V.P., Razumov V.I., Sizikova L.G. The genetically caused logic structures

74. Sokolova V.V., Novoseltsev V.B. Modelling of recursive structures

75. Stecher J.D. An Application of Formal Topology to the Choice of Standards for a Reporting Language

76. Stepanova A. Additive poligons theory

77. Stukachev A.I. On Mass Problems of Presentability

78. Stukacheva M. Canonical formulas for extensions of minimal logic

79. Sudoplatov S.V. On saturated generic models

80. Sulis W.H. Archetypal Dynamics, Tapestries, and Logic

[1]

[41]

[81]

Mail to Webmaster alc9@math.nsc.ru

|Home Page| |English Part|

Go to Home