Èíôîðìàöèîííàÿ ñèñòåìà "Êîíôåðåíöèè"
The 9
th
Asian Logic Conference
16-19 August, 2005
Novosibirsk, Russia
List reports
Number of reports: 92
[
1
]
[
41
]
[
81
]
Alaev P.E.
Computable Boolean algebras
Arai T.
Some results in the epsilon substitution method
Arbiser A.
Abstract rewriting systems and subsystems: understanding subcalculi and strategies
Ardeshir M.
Basic Arithmetics
Ashaev I.V.
Graph Theorem for Computability over Algebraic Structures
Babyonyshev S.V.
Another characterization of Deduction-Detachment theorem
Badaev S.A.
,
Talasbaeva Zh.T.
Computability in the Ershov Hierarchy
Baizhanov B.S.
Expansions of models of stable theories and weakly benign property.
Beklemishev L.D.
On limit existence principles in formal arithmetic.
Beliakin N.
One $omega$-inconsistent formalization of set theory
Choe K.-M., Eo H.,
O S.
,
Shilov N.V.
, Yi K.
Proofs about folklore: why model checking = reachability?
Costa-Leita A.
Paraconsistentization of logics
Curien P.
Sequential algorithms as bistable maps
Davydov A.V.
Development and applications of calculation of positive-constructed formulas
Demenkov P.S.
, Y. Kharlamov E.Y.
Discrete modeling of structure preserving mutations in proteins.
Dimitracopaulos C,
Sirokofskich A.I.
On a problem of L.D. Beklemishev
Djelloul K.
, Colmerauer A.
Combination of Trees and Additive Real numbers in a Complete First-Order Theory.
Dobritsa V.P.
Work Neural Sistems from point of view fazzy vektors
(
abstract in russian
)
Ershov Y.L.
Model-theoretical properties of multi-valued fields.
Gao S.
Unitary group actions and classification problems
Gavryushkin A.N.
The Complexity of Ehrenfeucht Models
()
Gencer C.
Basis For Passive Inference Rules In The Modal Logic K 4
Glushkova V.N.
The Computable Sigma-Specifications of Hierarchical Kripke Worlds
Hausser R.R.
Comparing Left-Associative Grammar with PSG
Hirschfeldt Denis R. ,
Khoussainov B.
,
Semukhin P.M.
An uncountably categorical theory whose only computably presentable model is saturated
Hoang C.
Truth & Proof in Arithmetic
Jain S.
, Kinber E.
Negative Data in Learning Languages
Juriev D.N.
,
Postnov S.S.
The non-classical three-valued logic and artificial intelligence: conjunction of deterministic and fuzzy approach.
Kanovei V.
On two inductive Borel irreducibility theorems
Kazachkov I.V.
Universal Theory of Free Metabelian Lie Algebra over a Finite Field
()
Khisamiev N.
On constructive nilpotent groups.
Khomich V.I.
The simple substitution property for superintuitionistic and modal logics
Khoussainov B.
, Slaman T.,
Semukhin P.M.
On Ï
0
1
- presentations of algebras
Khoussainov B.M.
On Finitely Presented Expansions of Algebras.
Korovin K.
,
Voronkov A.
Random Structures and Thresholds for Existential Fragment of First-Order Logic
Korovina M.
, N.Vorobjov
Pfaffian hybrid systems
Kovalyov S.P.
MODEL-THEORETIC METHODS OF ANALYSIS OF COMPUTER ARITHMETIC
Kralin S.S.
Contingency in S4
Kucher V.A.
, Liakhov A.V.
The methods of use Intuition calculation of utterances.
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
© 1996-2000, Siberian Branch of Russian Academy of Sciences, Novosibirsk
Last update: 06-Jul-2012 (11:44:52)