Corpus ID: 9400279

History of Mathematical Logic in Serbia

@inproceedings{Petri2013HistoryOM,
  title={History of Mathematical Logic in Serbia},
  author={Z. Petri and Miodrag Stankovi and R. Stankovi},
  year={2013}
}
The paper presents a brief historical overview of research in the area of mathematical logic and applications in Serbia. This review covers the period from the beginning of research in this area in Serbia until 1995. 1. Preface 2. Seminar on mathematical logic 3. Serbian journals in mathematical logic and applications 4. Topics of research in mathematical logic in Serbia 4.1. Automated reasoning 4.2. Automatic provers 4.3. Forcing, model theory and set-theoretic topology 5. Model theory 6… Expand

Tables from this paper

References

SHOWING 1-10 OF 122 REFERENCES
Logical Constants as Punctuation Marks
  • K. Dosen
  • Mathematics, Computer Science
  • Notre Dame J. Formal Log.
  • 1989
TLDR
An account of philosophical analysis is presented which covers the proposed analyses of logical constants and its role in the science of formal deductions. Expand
Sequent-systems and groupoid models. I
  • K. Dosen
  • Mathematics, Computer Science
  • Stud Logica
  • 1988
The purpose of this paper is to connect the proof theory and the model theory of a family of propositional logics weaker than Heyting's. This family includes systems analogous to the Lambek calculusExpand
Functional completeness and weak completeness in set logic
TLDR
It is shown that r-valued set logic is isomorphic to 2/sup r/-valued logic, meaning that the well-known completeness criteria in multiple-valued Post algebras apply to set-valued logic. Expand
Modal translations in substructural logics
  • K. Dosen
  • Mathematics, Computer Science
  • J. Philos. Log.
  • 1992
TLDR
It is proved that first-order variants of theselogics with an intuitionistic negation can be embedded by modal translations into S40type extensions of these logics with a classical, involutive, negation. Expand
On certain normalizable natural deduction formulations of some propositional intermediate logics
TLDR
This paper will present several normalizable formulations of some intermediate logics, some of the known cut-free Gentzen-type formulations of certain intermediatelogics, from the class of proofs in a (cut-free) sequent calculus into theclass of derivations of the corresponding sequenceconclusion natural deduction system. Expand
On the Structure of Kripke Models of Heyting Arithmetic
  • Z. Markovic
  • Mathematics, Computer Science
  • Math. Log. Q.
  • 1993
TLDR
It is proved that the classical structures at the nodes of a Kripke model of HA must be models of IΔ1 (PA- with induction for provably Δ1 formulas) and that the relation between these classical structures must be that of a Δ1-elementary submodel. Expand
Sequent-Systems for Modal Logic
  • K. Dosen
  • Mathematics, Computer Science
  • J. Symb. Log.
  • 1985
TLDR
The aim of this work is to present Gentzen-style formulations of the modal logics S5 and S4 based on sequents of higher levels, and to show how a restriction on Thinning of level 2, which when applied to Thinning on the right of level 1 produces intuitionistic out of classical logic, produces S4 out of S5. Expand
Models for normal intuitionistic modal logics
Kripke-style models with two accessibility relations, one intuitionistic and the other modal, are given for analogues of the modal systemK based on Heyting's prepositional logic. It is shown thatExpand
Les derivees partielles des fonctions pseudo-booleennes generalisees
  • C. Ghilezan
  • Computer Science, Mathematics
  • Discret. Appl. Math.
  • 1982
This paper is devoted to a study of differential calculus for generalised pseudo-Boolean functions with finite domain and antidomain P with a ring structure which may be infinite. A completely newExpand
Completeness Theorem for Biprobability Models
  • M. Raskovic
  • Mathematics, Computer Science
  • J. Symb. Log.
  • 1986
The aim of the paper is to prove the completeness theorem for biprobability models. This also solves Keisler's Problem 5.4 (see [4]). Let be a countable admissible set and ω ∈ . The logic is similarExpand
...
1
2
3
4
5
...