WorldCat Identities

Bauer, Andrej

Overview
Works: 126 works in 139 publications in 3 languages and 264 library holdings
Genres: Dictionaries 
Roles: Thesis advisor, Author, Editor, Other, Opponent, Author of introduction
Publication Timeline
.
Most widely held works by Andrej Bauer
Bilten by Tekmovanje IJS v znanju računalništva( Book )

4 editions published between 2008 and 2013 in Slovenian and held by 59 WorldCat member libraries worldwide

Računalniški slovarček : angleško-slovenski, slovensko-angleški( Book )

1 edition published in 1993 in English and held by 22 WorldCat member libraries worldwide

Angleško-slovenski in slovensko-angleški slovar računalniškega izrazoslovja
Predstavitev študijskih programov iz matematike by Fakulteta za matematiko in fiziko (Ljubljana)( Book )

3 editions published between 2007 and 2009 in Slovenian and held by 12 WorldCat member libraries worldwide

Matematika : študijski programi 1. stopnje by Fakulteta za matematiko in fiziko (Ljubljana)( Book )

2 editions published between 2008 and 2013 in Slovenian and held by 11 WorldCat member libraries worldwide

CCA 2009 Sixth International Conference on Computability and Complexity in Analysis ; August 18-22, 2009, Ljubljana, Slovenia by International Conference on Computability and Complexity in Analysis( Book )

2 editions published in 2009 in English and held by 8 WorldCat member libraries worldwide

Study programs in mathematics by Fakulteta za matematiko in fiziko (Ljubljana)( Book )

1 edition published in 2008 in English and held by 5 WorldCat member libraries worldwide

Altius, citius, fortius : [izbrana poglavja iz matematike za srednješolce] by Matjaž Željko( Book )

1 edition published in 1995 in Slovenian and held by 5 WorldCat member libraries worldwide

Teorija kategorij in Cassirerjeva filozofija matematike : doktorska disertacija by Maja Lovrenov( Book )

1 edition published in 2013 in Slovenian and held by 4 WorldCat member libraries worldwide

Multibasic and mixed Gosper's algorithm by A Bauer( )

2 editions published in 1998 in English and held by 3 WorldCat member libraries worldwide

Gosperjev sumacijski algoritem poišče hipergeometrijsko zaključeno obliko nedoločene vsote s hipergeometrijskimi členi, če takšna oblika obstaja. Gosperjev algoritem posplošimo na primer, ko so členi hkrati hipergeometrijski in multibazni $q$-hipergeometrijski. Podani so tudi algoritmi za računanje hipergeometrijske kanonske oblike racionalnih funkcij in za iskanje polinomskih rešitev rekurzivnih enačb v multibaznem in mešanem primeru
Third Workshop on Formal Topology : [3WFTop took place in Padua from 9 to 12 May 2007]( Book )

1 edition published in 2012 in English and held by 3 WorldCat member libraries worldwide

Predstavitev znanja in vrednotenje učinkovitosti sodelujočih samodejnih sistemov za dialog : doktorska disertacija by Melita Hajdinjak( Book )

1 edition published in 2006 in Slovenian and held by 3 WorldCat member libraries worldwide

Certification de programmes avec des effets calculatoires by Burak Ekici( )

1 edition published in 2015 in English and held by 3 WorldCat member libraries worldwide

In this thesis, we aim to formalize the effects of a computation. Indeed, most used programming languages involve different sorts of effects: state change, exceptions, input/output, non-determinism, etc. They may bring ease and flexibility to the coding process. However, the problem is to take into account the effects when proving the properties of programs. The major difficulty in such kind of reasoning is the mismatch between the syntax of operations with effects and their interpretation. Typically, a piece of program with arguments in X that returns a value in Y is not interpreted as a function from X to Y , due to the effects. The best-known algebraic approach to the problem interprets programs including effects with the use of monads: the interpretation is a function from X to T(Y) where T is a monad. This approach has been extendedto Lawvere theories and algebraic handlers. Another approach called, the decorated logic, provides a sort of equational semantics for reasoning about programs with effects. We specialize the approach of decorated logic to the state and the exceptions effects by defining the decorated logic for states (L_st) and the decorated logic for exceptions (L_exc), respectively. This enables us to prove properties of programs involving such effects. Then, we formalize these logics in Coq and certify the related proofs. These logics are built so as to be sound. In addition, we introduce a relative notion of syntactic completeness of a theory in a given logic with respect to a sublogic. We prove that the decorated theory for the global states as well as two decorated theories for exceptions are syntactically complete relatively to their pure sublogics. These proofs are certified in Coq as applications of ourgeneric frameworks
Tomo Kralj Tona : [monografija] by Tomo Kralj( Book )

1 edition published in 1985 in Croatian and held by 3 WorldCat member libraries worldwide

Constructing [square omega sub 1] by means of forcing with finite conditions : doctoral thesis by Gregor Dolinar( Book )

1 edition published in 2013 in English and held by 2 WorldCat member libraries worldwide

The main result of the dissertation is a construction of $\square_{\omega_1}$ by means of cardinal preserving forcing with finite conditions. We use Todorčević's method of adding countable elementary models as side conditions to prove that the forcing in question is proper thus ensuring the preservation of $\omega_1$. To show that $\omega_2$ is preserved we prove that the forcing is $\omega_2$-presaturated. Additionally, we construct a nontrivial version of $\square_{\omega}$ in a similar way
Preddoločanje in kontinuumska funkcija : magistrsko delo by Miha Emerik Habič( Book )

2 editions published in 2012 in Slovenian and held by 2 WorldCat member libraries worldwide

Linux - čisto pravi unix by A Bauer( )

1 edition published in 1994 in Slovenian and held by 2 WorldCat member libraries worldwide

Analytica - An experiment in combining theorem proving and symbolic computation by A Bauer( )

2 editions published in 1996 in English and held by 2 WorldCat member libraries worldwide

Analytika je avtomatski dokazovalnik za izreke s področja elementarne analize. Napisan je v programskem jeziku Mathematica in teče v aplikaciji Mathematica. Za cilj tega projekta smo želeli dokazati izreke, ki jih klasični avtomatski dokazovalniki ne znajo. Združili smo avtomatski dokazovalnik s sistemom za simbolno računanje. Avtomatski dokazovalnik zna dokazati pravilnost nekaterih korakov, ki jih sicer ne bi mogli izvesti. V članku opišemo, kako Analytica deluje in kakšne metode dokazovanja uporablja. Analytica je uspešno dokazala nekaj netrivialnih izrekov. Opišemo niz pomožnih izrekov, ki jih zna Analytica dokazati, iz njih pa sledi Bernsteinov izrek o aproksimacijah
Relational algebra with similarities : doctoral thesis by Melita Hajdinjak( Book )

1 edition published in 2012 in English and held by 2 WorldCat member libraries worldwide

Vračanje informacij, ki niso natančni odgovori na zastavljeno vprašanje, so pa relevantni oziroma blizu tistemu, kar je bilo vprašno, je splošna lastnost človeške komunikacije, znana kot sodelujoče odgovarjanje. Čeprav je naš namen modelirati to vrsto poizvedovanja oziroma podajanja informacij, najprej predstavimo in primerjamo dva izmed najbolj razširjenih podatkovnih modelov, relacijsko algebro in Datalog. Poizvedovanja po netočnih, približnih informacijah klasična relacijska algebra sicer ni sposobna modelirati, a prednosti tega najbolj priljubljenega podatkovnega modela nas prepričajo v to, da iščemo ustrezne posplošitve. Naše izhodišče predstavlja $\mathcal{K}$-relacijski model, zato predstavimo pozitivno relacijsko algebro RA$^+_\mathcal{K}$, kakor tudi njeno razširitev, algebro RA$^+_\mathcal{K}(\setminus)$, ki omogoča tudi negativne poizvedbe. Ker je bil namen raziskav, ki so vodile do $\mathcal{K}$-relacijskega modela, izdelati splošen model označenih relacij, preverimo, ali $\mathcal{K}$-relacijski model in algebra RA$^+_\mathcal{K}(\setminus)$ omogočata modeliranje poizvedovanja, ki temelji na podobnostih. Ugotovimo, da model v ključnih primerih sodelujočega odgovarjanja ne da pričakovanega rezultata, in zato predlagamo nov način modeliranja negativnih poizvedb. Da bi v posplošenem relacijskem modelu ohranili vse temeljne identitete, ki veljajo v klasični relacijski algebri, predlagamo zamenjavo $\mathcal{K}$-relacijskega modela, v katerem je $\mathcal{K}$ $m$-polkolobar, z $\mathcal{L}$-relacijskim modelom, v katerem je $\mathcal{L}$ De Morganov okvir. Zaradi želje modelirati tudi zahtevnejše primere poizvedovanj predlagamo še spremenjen način označevanja; namesto označevanja vrstic z elementi istega polkolobarja oziroma De Morganovega okvirja predlagamo označevanje vrstic z večtericami, kjer vsakemu atributu pripada lastna označevalna domena. $\mathcal{L}$-relacije posplošimo na $\mathcal{D}$-relacije, algebro na $\mathcal{D}$-relacijah pa imenujemo relacijska algebra s podobnostmi, RA$_\mathcal{D}$. V nadaljevanju proučmo Datalog programe na $\mathcal{D}$-relacijah in vpeljemo mero podobnosti med $\mathcal{D}$-relacijami, ki lahko služi primerjavi različnih odgovorov na isto vprašanje. Predlagamo še $\mathcal{D}$-relacijski algebri prilagojeno razširitev poizvedovalnega jezika SQL s pragovnimi vrednostmi in vgrajenimi funkcijami in podamo nekatera zanimiva kategorno-teoretična opažanja
Synthetic topology and constructive metric spaces : doctoral thesis by Davorin Lešnik( Book )

1 edition published in 2010 in English and held by 2 WorldCat member libraries worldwide

Disertacija predstavi področje sintetične topologije, zlasti njeno povezavo z metričnimi prostori. Model sintetične topologije je kategorični model, v katerem objekti posedujejo intrinzično topologijo v ustreznem smislu, glede na katero so vsi morfizmi zvezni. Definicije in izreki sintetične topologije so posplošeni, med drugim tako, da vključujejo zaprte množice. Realna števila so (zaradi sintetičnega ozadja) rekonstruirana kot odprti Dedekindovi rezi. Obširna teorija je razvita o tem, kdaj se metrična in intrinzična topologija ujemata. Na koncu proučimo dobljene rezultate v štirih izbranih modelih
256-glava zver premagala kralja by A Bauer( )

1 edition published in 1997 in Slovenian and held by 2 WorldCat member libraries worldwide

 
moreShow More Titles
fewerShow Fewer Titles
Audience Level
0
Audience Level
1
  Kids General Special  
Audience level: 0.79 (from 0.55 for Study prog ... to 0.97 for Analytica ...)

Alternative Names
Andrej Bauer Slovenian Mathematician

Andrej Bauer wiskundige uit Slovenië

Bauer, Andrej

Андрей Бауэр

أندريه باور

안드레이 바우에르

Languages