Browsing Mathematical Sciences by Title
-
Stewart, Ian; Jones, Robin (Beograd , 1986)[more][less]
-
Popović, Lidija; Popović, Momir (Mladenovac , 1985)[more][less]
-
Tanaskoski, Dragan; Milinković, Stevan; Janković, Vladimir (Beograd , 1986)[more][less]
URI: http://hdl.handle.net/123456789/4013 Files in this item: 1
Comodore_za_sva_vremena.PDF ( 3.848Mb ) -
Mitrinović, D. S.; Adamović, D. D. (ELEKTROTEHNIČKI FAKULTET UNIVERZITETA U BEOGRADU , 1966)[more][less]
-
Više autora (Ruse, Bulgaria , 2012)[more][less]
URI: http://hdl.handle.net/123456789/3293 Files in this item: 1
13IntConfCompSysTech_399_2012.pdf ( 5.886Mb ) -
Marković, Mihailo (University of London , 1956)[more][less]
-
Danić, Dimitrije (, 1885)[more][less]
Abstract: Tema Danićeve disertacije su konformna preslikavanja eliptičkog paraboloida na ravan, prateći definicije i formalizam koje je uveo Gaus (F. Gauss) za tu vrstu preslikavanja. U tom razmatranju izveo je određene parcijalne diferencijalne jednačine koje takođe analizira i rešava. Njegov doprinos bile su metode u rešavanju kompleksnih eliptičkih integrala, uvođenju eliptičkih transformacija i primeni eliptičkih funkcija u rešavanju ovih parcijalnih jednačina. URI: http://hdl.handle.net/123456789/4796 Files in this item: 3
DDanic_thesis_documentation.pdf ( 239.6Kb )DDanic_thesis_transl_SRB.pdf ( 1.764Mb )DDanic_thesis.pdf ( 1.420Mb ) -
Sierpinski, W.; Klein, F.; Runge, C.; Dickson, L. E. (New York , 1954)[more][less]
-
Prešić, Slaviša (Belgrade , 1980)[more][less]
-
Ignjatović, Lj.; Mihajlov, A.; Metropoulos, A.; Sakan, N.; Dimitrijević, M. (Belgrade , 2009)[more][less]
-
Adamović, Dušan; Leko, Marko; Milić, Svetozar; Prešić, Slaviša; Trifunović, Dragan; Trifunović, Dragan (Mathematical Institute SASA, Belgrade , 1992)[more][less]
URI: http://hdl.handle.net/123456789/597 Files in this item: 1
ViseAutoraPriloziOMatematickimNaukamaKodSrba.PDF ( 9.676Mb ) -
Mijajlović, Žarko (Belgrade , 1977)[more][less]
Abstract: Part1. Basic notions of model theory are given. Part2. Dual notions in categories of Boolean algebras and Stone spaces are studied in respect to natural contra-variant functor. The cellularity number of a Boolean algebra B, celB is studied, certain cardinal properties are proved, e.g. it is consistent with ZFC that celB is attained for every Boolean algebra B. Part3. Lindenbaum algebras of first-order theories are studied in details. It is proved that every Boolean algebra is isomorphic to the Lindenbaum algebra B1 of Σ1 formulas of certain first-order complete theory. Stability number ST(k) of a first-order theory T is studied, and it is shown that ST(k) = Ku(k), where Ku(k) is the Kurepa number (Kurepa introduced it in 1935) and T is the theory of dense linear ordering without end-points, while the cardinality of the Stone space of B1(A), A is a model of T, is equal to ded(A), the Dedekind number of the ordering A. Ku(k)= sup{ded(A): A is a model of T, |A|=k}. Part4. Σn Πn ramifications of various notions in model theory are defined and studied, e.g. elementary embeddings, completeness, chains, direct limits, diagram properties, etc. Preservation theorems for these types of formulas are proved. Examples for including ordered structures and algebraic fields are given. Part5. Model completions and elimination of quantifiers are studied. As an application, it is proved that by means of model theory that the classes of Boolean algebras and distributive lattices with the least and the greatest elements are Jonsson’s classes. Algebraic description of saturated models of submodel-complete theories are given, unifying results of Haussdorff (dense linear ordering), Erdös, Gillman (ordered fields) and Boolean algebras (Negrepontis) for homogeneous-universal models. Part6. Here is studied what model-theoretic properties are absolute in ZF in the sense introduced by Levy, i.e. in which cases strong hypothesis (AC, GCH, V=L) can be eliminated from the proof of these properties. It is shown that the following properties of first-order theories are absolute: the consistency, completeness, model-completeness and elimination of quantifiers. These gives new light on model-theoretic proofs of these properties. URI: http://hdl.handle.net/123456789/196 Files in this item: 1
phdZarkoMijajlovic.pdf ( 27.39Mb ) -
Božić, Milan (Belgrade , 1983)[more][less]
Abstract: The thesis consists of five chapters. In the introductory chapter some relational-operational structures building of sets of formulas in calculi RA^+ and R^+ are presented. These structures are used in other chapters in making of the canonical frames of Kripke’ type for semantic of positive fragments of relevant propositional calculi. In Chapter 1, the semantic of these positive fragments, which is a mixture of known Routley & Meyer’s and Maksimova’s semantics, is presented. A new way for the semantic of negation in relevant logics is introduced in Chapter 2. It this way semantic completeness theorems for a large class of expansions of the logic R_min are proved. It is shown that Routley & Meyer’s semantic for the logic R is a special case of that semantic. Relevant modal logics are studied in Chapter 3. A semantic of Kripke’s type by which a completeness of a large class of modal logics whose basics are different relevant calculi with or without negation is introduced. A characterization of a large class modal i.e. Hintikka, schemas is given too. They contain almost all modal schemas characterized by formulas of the first order. Moreover, it is proved that the only known semantic for the calculus R_⊙ is a special case of the semantic given in this chapter. Semantics of relevant calculi which are not distributive are studied in Chapter 4. It is shown that semantics of non-distributive relevant logics radically change Kripke’s semantic. URI: http://hdl.handle.net/123456789/340 Files in this item: 1
phdMilanBozic.pdf ( 36.24Mb ) -
Tošić, Ratko (Belgrade , 1978)[more][less]
Abstract: The thesis consists of five chapters. In Chapter 1 definitions and well-known results from the theory of Boolean algebras and Boolean functions are given. In Chapter 2 of the thesis some properties of Boolean functions, which preserve constants under finite Boolean algebras, are presented by using the component representation. Their consequences about the number of Boolean’s functions are also given. The theorems which are the generalization of Scognmaiglio’s theorem and Andreoli’s theorem for Boolean functions with one variable, are proved in Chapter 3. The following new notions are introduced for monotone logical functions: the profile, the level, homogeneous, the corresponding matrix, etc. Some properties of these functions are shown and some consequences about the number of homogeneous monotone logical functions are presented. In Chapter 4 the applications of monotone Boolean functions in solving the problems of search theory (a branch of the theory of information) are presented. It is shown that the general problem of a type is, in fact, the problem of identifications of homogeneous monotone Boolean functions of the given profile by checking the value of that function for combinations of values of variables. Optimal or almost optimal solutions for some profiles are shown. It is also shown that monotonic logical functions are natural instrument for the generalization of these problems. Some open problems are presented in Chapter 5. URI: http://hdl.handle.net/123456789/356 Files in this item: 1
phdRatkoTosic.pdf ( 3.843Mb ) -
Vujošević, Slobodan (Belgrade , 1981)[more][less]
Abstract: The thesis consists of three chapters. Heyting algebras are studied as an equality category in Chapter 1. The properties of filters and ideals of Heyting algebras are presented together with corresponding properties in distributive nets and Boolean algebras. Free, injective and projective Heyting algebras are presented and a theorem about the representation in algebras with closing is proved. Some properties of Heyting algebras, which are important for study of formal logics closely to intuitionistic logic, are also presented. Complete Heyting algebras are studied in Chapter 2. The family of complete Heyting algebras is obtained by repeating of the construction of the algebra of J-operators. Some properties of this family when the initial Heyting algebras is linear order, are studied. Moreover, the characterization of complete Heyting algebras which can be approximated by complete Boolean algebras is given. Duality of categories of topological spaces and complete Heyting algebras are studied in Chapter 3. Some adjunctions are defined, and for those adjunctions the actions of monad and comonad are studied. It is shown that the category of complete Heyting algebras is reflective in the categories of sets, distributive bounded nets and complete Heyting algebras. It is shown that complete Heyting algebras correspond to "deposited" spaces, and distributive bounded nets correspond to a restriction of Ston’s spaces. URI: http://hdl.handle.net/123456789/89 Files in this item: 1
phdSlobodanVujosevic.pdf ( 3.553Mb ) -
Boričić, Branislav (Belgrade , 1983)[more][less]
Abstract: The thesis consists of four chapters. Chapter 1 contains a general framework for deductive systems and contains a sequence-conclusion natural deduction system for classical first order logic. A sequence NLC_n of intermediate propositional logics is considered in Chapter 2. It is shown that the sequence NLC_n contains three different systems only. These are the classical calculus NLC_1, Dummett's system NLC_2 and the logic NLC_3, an extension of the Heyting propositional logic by the axiom (A⇒B)∨(B⇒C)∨(C⇒A) . It is also shown that the logic NLC_3 is separable. In the sequel, the completeness of NLC_3 with respect to the corresponding Kripke type models having the property that ∀x∀y∀z(xRy∨yRz∨zRx) is proved, as well as its decidability and the independence of logical connectives. It is shown that some subsystems of NLC_3 are separable and that the limits of the considered systems is the Heyting propositional calculus. The logic of the weak law of excluded middle, an extension of the Heyting logic by ¬A∨¬¬A, is considered in Chapter 3. An embedding of classical logic into this logic is described and it is proved that this logic is the minimal one having this property. A Hilbert-type formulation of implication fragment of the Heyting propositional logic formalizing the deducibility relation, is presented in Chapter 4, enabling to define a decision procedure based on a kind of cut-elimination theorem. URI: http://hdl.handle.net/123456789/257 Files in this item: 1
phdBranislavBoricic.PDF ( 5.899Mb ) -
Adamović, Dušan (MATHEMATICA MORAVICA , 2000)[more][less]
URI: http://hdl.handle.net/123456789/736 Files in this item: 1
DusanAdamovicCo ... DansUnTravailAnterieur.pdf ( 176.8Kb ) -
Nepoznati autor (Beograd , 1967)[more][less]
-
Vacquant, Ch. (Paris , 1890)[more][less]
-
Antić, Miroslava (Belgrade)[more][less]