ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
  • Articles  (10,854)
  • Springer  (8,713)
  • Institute of Electrical and Electronics Engineers (IEEE)  (2,014)
  • American Chemical Society
  • American Chemical Society (ACS)
  • American Geophysical Union
  • Frontiers Media
  • National Academy of Sciences
  • 2015-2019  (5,758)
  • 2005-2009  (4,356)
  • 1990-1994
  • 1980-1984  (740)
  • 2017  (5,758)
  • 2009  (2,248)
  • 2008  (2,108)
  • 1983  (740)
  • Computer Science  (9,125)
  • Philosophy  (1,729)
Collection
  • Articles  (10,854)
Source
Keywords
Publisher
Years
  • 2015-2019  (5,758)
  • 2005-2009  (4,356)
  • 1990-1994
  • 1980-1984  (740)
Year
Journal
Topic
  • 1
    Electronic Resource
    Electronic Resource
    st-Ordering the vertices of biconnected graphs (1983)
    Springer
    Computing 30 (1983), S. 19-33 
    Details
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung IstG ein zweifach zusammenhängender Graph mit zwei verschiedenen Knotens undt, so wird seine Knotenmenge derart zwischens undt angeordnet, daß jeder weitere Knoten zwischen zweien seiner Nachbarn liegt. Es wird ein Algorithmus angegeben, der aus einer einfachen Tiefensuche abs mit einer zusätzlichen Nachbearbeitung besteht, die nur einen Zeit- und Speicheraufwand der Ordnung 0(n) erfordert.
    Notes: Abstract Given a biconnected graphG and two distinct verticess andt, the vertices ofG are sorted in such a way, thats is first,t is last, and every other vertex is somewhere between two of its neighbours. An algorithm is given which consists of a simple depth-first search starting froms followed by some additional postprocessing. The latter uses only 0(n) time and space.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02253293
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    Mehrstufige Auswahldisziplin in einem M/G/1-Processor-sharing-System mit Prioritäten (1983)
    Springer
    Computing 30 (1983), S. 1-18 
    Details
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Abstract In this paper the well-known multilevel processor-sharing algorithm for M/G/1 systems without priorities is extended to M/G/1 systems with priority classes. The average response timeT j (x) and the average waiting timeW j (x) for aj-class job, which requires a total service ofx sec, is analytically calculated. Some figures demonstrate, how the priority classes and the total number of the different levels affect the behavior of the functionsT j (x) andW j (x). In addition, the foreground-background algorithm with priorities, which is in the literature not yet covered, is treated as a special case of the multilevel processor-sharing algorithm.
    Notes: Zusammenfassung Die bekannte mehrstufige Processor-sharing-Disziplin in M/G/1-Systemen ohne Prioritäten wird auf M/G/1-Systeme mit Prioritäten erweitert und untersucht. Dabei wird die mittlere VerweilzeitT j (x) und die mittlere WartezeitW j (x) für einen Auftrag derj-Klasse mitx sec Servicebedarf analytisch berechnet. An Hand einiger graphischer Darstellungen wird die Abhängigkeit der FunktionenT j (x) undW j (x) von der Prioritätsklasse und der Stufenanzahl veranschaulicht. Ferner wird die in der Literatur noch nicht behandelte Foreground-Background-Disziplin mit Prioritäten als Spezialfall der mehrstufigen Processor-sharing-Disziplin untersucht.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02253292
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 3
    Electronic Resource
    Electronic Resource
    An extension of the deontic calculus DSC1 (1983)
    Springer
    Studia logica 42 (1983), S. 129-137 
    Details
    ISSN: 1572-8730
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Philosophy
    Notes: Abstract The chief aim of the paper is to extend the calculusDSC 1 (see [4]) in such a way as to satisfy all the requirements listed in [4] as well as a further stipulation — called ‘the principle of uninvolvement’ — to the effect that neither deontic compatibility nor deontic incompatibility of codes (see [2]) should be presupposed in deontic logic.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01063834
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 4
    Electronic Resource
    Electronic Resource
    Subject-predicate calculus free from existential import (1983)
    Springer
    Studia logica 42 (1983), S. 209-221 
    Details
    ISSN: 1572-8730
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Philosophy
    Notes: Abstract Two subject-predicate calculi with equality,SP = and its extensionUSP′ =, are presented as systems of natural deduction. Both the calculi are systems of free logic. Their presentation is preceded by an intuitive motivation. It is shown that Aristotle's syllogistics without the laws of identitySaP andSiP is definable withinSP =, and that the first-order predicate logic is definable withinUSP′ =.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01063841
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 5
    Electronic Resource
    Electronic Resource
    On the complexity-relativized strong reducibilites (1983)
    Springer
    Studia logica 42 (1983), S. 259-267 
    Details
    ISSN: 1572-8730
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Philosophy
    Notes: Abstract This paper discusses refinements of the natural ordering of them-degrees (1-degrees) of strong recursive reducibility classes. Such refinements are obtained by posing complexity conditions on the reduction function. The discussion uses the axiomatic complexity theory and is hence very general. As the main result it is proved that if the complexity measure is required to be linearly bounded (and space-like), then a natural class of refinements forms a lattice with respect to a natural ordering upon them.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01063845
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 6
    Electronic Resource
    Electronic Resource
    Logical operations and iterated infinitely deep languages (1983)
    Springer
    Studia logica 42 (1983), S. 243-249 
    Details
    ISSN: 1572-8730
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Philosophy
    Notes: Abstract We discuss an abstract notion of a logical operation and corresponding logics. It is shown that if all the logical operations considered are implicitely definable in a logic ℒ*, then the same holds also for the logic obtained from these operations. As an application we show that certain iterated forms of infinitely deep languages are implicitely definable in game quantifier languages. We consider also relations between structures and show that Karttunen's characterization of elementary equivalence for the ordinary infinitely deep languages can be generalized to hold for the iterated infinitely deep languages. An early version of this work was presented in the Abstracts Section of ICM '78.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01063843
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 7
    Electronic Resource
    Electronic Resource
    A decision procedure for the systemE (of entailment). I. (1983)
    Springer
    Studia logica 42 (1983), S. 139-164 
    Details
    ISSN: 1572-8730
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Philosophy
    Notes: Abstract A system of natural deduction is presented whose set of theses is identical with that of the systemE of entailment. For that system a decision procedure is described proving the decidability ofE.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01063835
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 8
    Electronic Resource
    Electronic Resource
    On some proof theoretical properties of the modal logic GL (1983)
    Springer
    Studia logica 42 (1983), S. 453-459 
    Details
    ISSN: 1572-8730
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Philosophy
    Notes: Abstract This paper deals with the system of modal logicGL, in particular with a formulation of it in terms of sequents. We prove some proof theoretical properties ofGL that allow to get the cut-elimination theorem according to Gentzen's procedure, that is, by double induction on grade and rank.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01371633
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 9
    Electronic Resource
    Electronic Resource
    Completeness theorems for some intermediate predicate calculi (1983)
    Springer
    Studia logica 42 (1983), S. 431-441 
    Details
    ISSN: 1572-8730
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Philosophy
    Notes: Abstract We give completeness results — with respect to Kripke's semantic — for the negation-free intermediate predicate calculi: (1) $$\begin{gathered} BD = positive predicate calculus PQ + B:(\alpha \to \beta )v(\beta \to \alpha ) \hfill \\ + D:\forall x\left( {a\left( x \right)v\beta } \right) \to \forall xav\beta \hfill \\ \end{gathered}$$ (2) $$T_n D = PQ + T_n :\left( {a_0 \to a_1 } \right)v \ldots v\left( {a_n \to a_{n + 1} } \right) + D\left( {n \geqslant 0} \right)$$ and the superintuitionistic predicate calculus: (3) $$B^1 DH_2^ \urcorner = BD + intuitionistic negation + H_2^ \urcorner : \urcorner \forall xa \to \exists x \urcorner a.$$ The central point is the completeness proof for (1), which is obtained modifying Klemke's construction [3]. For a general account on negation-free intermediate predicate calculi — see Casari-Minari [1]; for an algebraic treatment of some superintuitionistic predicate calculi involving schemasB andD — see Horn [4] and Görnemann [2].
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01371631
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 10
    Electronic Resource
    Electronic Resource
    On the meaning of indexicals (1983)
    Springer
    Studia logica 42 (1983), S. 285-291 
    Details
    ISSN: 1572-8730
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Philosophy
    Notes: Abstract The approach adopted in the paper is based on the theory known as Montague grammar. Accepting, in general, that theory — especially in its modified version, which is due to Thomason and Kaplan — the author points out certain inadequacy in its treatment of the meaning of some indexical expressions and suggests some modification of its theoretical framework in order to avoid that shortcoming. It is claimed that to do justice to the meaning of so-called indefinite indexicals (such as “we”, “you”, “now”) two kinds of dependence of their semantic values upon the context of use must be taken into account — a semantic (or lexical) and a pragmatic (or extralexical) one.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01063847
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...