ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

Your email was sent successfully. Check your inbox.

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

Proceed reservation?

Export
Filter
  • Articles  (2,699)
  • Springer  (2,699)
  • American Institute of Physics (AIP)
  • Institute of Physics
  • 1995-1999  (2,461)
  • 1955-1959  (238)
  • Philosophy  (2,699)
Collection
  • Articles  (2,699)
Publisher
Years
Year
Journal
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    Studia logica 54 (1995), S. 1-2 
    ISSN: 1572-8730
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Philosophy
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    Studia logica 54 (1995), S. 129-137 
    ISSN: 1572-8730
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Philosophy
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    Springer
    Studia logica 54 (1995), S. 391-410 
    ISSN: 1572-8730
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Philosophy
    Notes: Abstract Our purpose is to formulate a complete logic of propositions that takes into account the fact that propositions are both senses provided with truth values and contents of conceptual thoughts. In our formalization, propositions are more complex entities than simple functions from possible worlds into truth values. They have a structure of constituents (a content) in addition to truth conditions. The formalization is adequate for the purposes of the logic of speech acts. It imposes a stronger criterion of propositional identity than strict equivalence. Two propositions P and Q are identical if and only if, for any illocutionary force F, it is not possible to perform with success a speech act of the form F(P) without also performing with success a speech act of the form F(Q). Unlike hyperintensional logic, our logic of propositions is compatible with the classical Boolean laws of propositional identity such as the symmetry and the associativity of conjunction and the reduction of double negation.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 4
    Electronic Resource
    Electronic Resource
    Springer
    Studia logica 55 (1995), S. 63-87 
    ISSN: 1572-8730
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Philosophy
    Notes: Abstract We continue a series of papers on a family of many-valued modal logics, a family whose Kripke semantics involves many-valued accessibility relations. Earlier papers in the series presented a motivation in terms of a multiple-expert semantics. They also proved completeness of sequent calculus formulations for the logics, formulations using a cut rule in an essential way. In this paper a novel cut-free tableau formulation is presented, and its completeness is proved.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 5
    Electronic Resource
    Electronic Resource
    Springer
    Studia logica 55 (1995), S. 113-127 
    ISSN: 1572-8730
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Philosophy
    Notes: Abstract Chang's MV algebras are the algebras of the infinite-valued sentential calculus of Łukasiewicz. We introduce finitely additive measures (called states) on MV algebras with the intent of capturing the notion of ‘average degree of truth’ of a proposition. Since Boolean algebras coincide with idempotent MV algebras, states yield a generalization of finitely additive measures. Since MV algebras stand to Boolean algebras as AFC*-algebras stand to commutative AFC*-algebras, states are naturally related to noncommutativeC*-algebraic measures.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 6
    Electronic Resource
    Electronic Resource
    Springer
    Studia logica 55 (1995), S. 259-271 
    ISSN: 1572-8730
    Keywords: Primary 03B45, 06E25 ; Secondary 18C10
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Philosophy
    Notes: Abstract We show that (contrary to the parallel case of intuitionistic logic, see [7], [4]) there does not exist a translation fromS42 (the propositional modal systemS4 enriched with propositional quantifiers) intoS4 that preserves provability and reduces to identity for Boolean connectives and □.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 7
    ISSN: 1572-8730
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Philosophy
    Notes: Abstract The main result is that is no effective algorithmic answer to the question:how to recognize whether arbitrary modal formula has a first-order equivalent on the class of finite frames. Besides, two known problems are solved: it is proved algorithmic undecidability of finite frame consequence between modal formulas; the difference between global and local variants of first-order definability of modal formulas on the class of transitive frames is shown.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 8
    Electronic Resource
    Electronic Resource
    Springer
    Studia logica 55 (1995), S. 99-112 
    ISSN: 1572-8730
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Philosophy
    Notes: Abstract In this paper we find an algebraic equivalent of the Hallden property in modal logics, namely, we prove that the Hallden-completeness in any normal modal logic is equivalent to the so-called super-embedding property of a suitable class of modal algebras. The joint embedding property of a class of algebras is equivalent to the Pseudo-Relevance Property. We consider connections of the above-mentioned properties with interpolation and amalgamation. Also an algebraic equivalent of of the principle of variable separation in superintuitionistic logics will be found.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 9
    Electronic Resource
    Electronic Resource
    Springer
    Studia logica 55 (1995), S. 129-179 
    ISSN: 1572-8730
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Philosophy
    Notes: Abstract Theabstract variable binding calculus (VB-calculus) provides a formal frame-work encompassing such diverse variable-binding phenomena as lambda abstraction, Riemann integration, existential and universal quantification (in both classical and nonclassical logic), and various notions of generalized quantification that have been studied in abstract model theory. All axioms of the VB-calculus are in the form of equations, but like the lambda calculus it is not a true equational theory since substitution of terms for variables is restricted. A similar problem with the standard formalism of the first-order predicate logic led to the development of the theory of cylindric and polyadic Boolean algebras. We take the same course here and introduce the variety of polyadic VB-algebras as a pure equational form of the VB-calculus. In one of the main results of the paper we show that every locally finite polyadic VB-algebra of infinite dimension is isomorphic to a functional polyadic VB-algebra that is obtained from a model of the VB-calculus by a natural coordinatization process. This theorem is a generalization of the functional representation theorem for polyadic Boolean algebras given by P. Halmos. As an application of this theorem we present a strong completeness theorem for the VB-calculus. More precisely, we prove that, for every VB-theory T that is obtained by adjoining new equations to the axioms of the VB-calculus, there exists a model D such that ⊢T s=t iff ⊨D s=t. This result specializes to a completeness theorem for a number of familiar systems that can be formalized as VB-calculi. For example, the lambda calculus, the classical first-order predicate calculus, the theory of the generalized quantifierexists uncountably many and a fragment of Riemann integration.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 10
    Electronic Resource
    Electronic Resource
    Springer
    Studia logica 55 (1995), S. 301-317 
    ISSN: 1572-8730
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Philosophy
    Notes: Abstract We give a set of postulates for the minimal normal modal logicK + without negation or any kind of implication. The connectives are simply ∧, ∨, □, ◊. The postulates (and theorems) are all deducibility statements ϕ ⊢ ψ. The only postulates that might not be obvious are $$\diamondsuit \varphi \wedge \square \psi \vdash \diamondsuit (\varphi \wedge \psi )\square (\varphi \vee \psi ) \vdash \square \varphi \vee \diamondsuit \psi $$ . It is shown thatK + is complete with respect to the usual Kripke-style semantics. The proof is by way of a Henkin-style construction, with “possible worlds” being taken to be prime theories. The construction has the somewhat unusual feature of using at an intermediate stage disjoint pairs consisting of a theory and a “counter-theory”, the counter-theory replacing the role of negation in the standard construction. Extension to other modal logics is discussed, as well as a representation theorem for the corresponding modal algebras. We also discuss proof-theoretic arguments.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 11
    Electronic Resource
    Electronic Resource
    Springer
    Studia logica 57 (1996), S. 3-4 
    ISSN: 1572-8730
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Philosophy
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 12
    Electronic Resource
    Electronic Resource
    Springer
    Studia logica 57 (1996), S. 73-90 
    ISSN: 1572-8730
    Keywords: deontic reasoning ; defeasible reasoning ; moral dilemmas
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Philosophy
    Notes: Abstract This paper compares two ways of formalising defeasible deontic reasoning, both based on the view that the issues of conflicting obligations and moral dilemmas should be dealt with from the perspective of nonmonotonic reasoning. The first way is developing a special nonmonotonic logic for deontic statements. This method turns out to have some limitations, for which reason another approach is recommended, viz. combining an already existing nonmonotonic logic with a deontic logic. As an example of this method the language of Reiter's default logic is extended to include modal expressions, after which the argumentation framework in default logic of [20, 22] is used to give a plausible logical analysis of moral dilemmas and prima facie obligations.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 13
    Electronic Resource
    Electronic Resource
    Springer
    Studia logica 57 (1996), S. 139-165 
    ISSN: 1572-8730
    Keywords: deontic logic ; database integrity ; constraints ; constraint violation ; recovery
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Philosophy
    Notes: Abstract The paper discusses the potential value of a deontic approach to database specification. More specifically, some different types of integrity constraints are considered and a distinction is drawn between necessary (“hard”) and deontic (“soft”) constraints. Databases are compared with other normative systems. A deontic logic for database specification is proposed and the problems of how to react to, and of how to correct, or repair, a situation which arises through norm violation are discussed in the context of this logic. The limitations of the proposed logic and possible modifications and extensions of it are analysed.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 14
    Electronic Resource
    Electronic Resource
    Springer
    Studia logica 57 (1996), S. 167-192 
    ISSN: 1572-8730
    Keywords: deontic logic ; supererogation ; ordering semantics ; indifference ; optimality
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Philosophy
    Notes: Abstract On the traditional deontic framework, what is required (what morality demands) and what is optimal (what morality recommends) can't be distinguished and hence they can't both be represented. Although the morally optional can be represented, the supererogatory (exceeding morality's demands), one of its proper subclasses, cannot be. The morally indifferent, another proper subclass of the optional-one obviously disjoint from the supererogatory-is also not representable. Ditto for the permissibly suboptimal and the morally significant. Finally, the minimum that morality allows finds no place in the traditional scheme. With a focus on the question, “What would constitute a hospitable logical neighborhood for the concept of supererogation?”, I present and motivate an enriched logical and semantic framework for representing all these concepts of common sense morality.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 15
    Electronic Resource
    Electronic Resource
    Springer
    Studia logica 57 (1996), S. 303-323 
    ISSN: 1572-8730
    Keywords: finite models ; substructural logics ; the Lambek calculus ; 03B40 ; 03B60
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Philosophy
    Notes: Abstract We prove the finite model property (fmp) for BCI and BCI with additive conjunction, which answers some open questions in Meyer and Ono [11]. We also obtain similar results for some restricted versions of these systems in the style of the Lambek calculus [10, 3]. The key tool is the method of barriers which was earlier introduced by the author to prove fmp for the product-free Lambek calculus [2] and the commutative product-free Lambek calculus [4].
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 16
    Electronic Resource
    Electronic Resource
    Springer
    Studia logica 57 (1996), S. 419-436 
    ISSN: 1572-8730
    Keywords: algebraizable logics ; equivalential logics ; implicative logics ; protoalgebraic logics
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Philosophy
    Notes: Abstract The notion of an algebraizable logic in the sense of Blok and Pigozzi [3] is generalized to that of a possibly infinitely algebraizable, for short, p.i.-algebraizable logic by admitting infinite sets of equivalence formulas and defining equations. An example of the new class is given. Many ideas of this paper have been present in [3] and [4]. By a consequent matrix semantics approach the theory of algebraizable and p.i.-algebraizable logics is developed in a different way. It is related to the theory of equivalential logics in the sense of Prucnal and Wroński [18], and it is extended to nonfinitary logics. The main result states that a logic is algebraizable (p.i.-algebraizable) iff it is finitely equivalential (equivalential) and the truth predicate in the reduced matrix models is equationally definable.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 17
    Electronic Resource
    Electronic Resource
    Springer
    Studia logica 58 (1997), S. 99-112 
    ISSN: 1572-8730
    Keywords: knowledge logic ; contingency ; completeness ; complexity
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Philosophy
    Notes: Abstract We show the completeness of a Hilbert-style system LK defined by M. Valiev involving the knowledge operator K dedicated to the reasoning with incomplete information. The completeness proof uses a variant of Makinson's canonical model construction. Furthermore we prove that the theoremhood problem for LK is co-NP-complete, using techniques similar to those used to prove that the satisfiability problem for propositional S5 is NP-complete.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 18
    Electronic Resource
    Electronic Resource
    Springer
    Studia logica 58 (1997), S. 3-16 
    ISSN: 1572-8730
    Keywords: modal logic ; information system ; complete calculus
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Philosophy
    Notes: Abstract A conception of an information system has been introduced by Pawlak. The study has been continued in works of Pawlak and Orlowska and in works of Vakarelov. They had proposed some basic relations and had constructed a formal system of a modal logic that describes the relations and some of their Boolean combinations. Our work is devoted to a generalization of this approach. A class of relation systems and a complete calculus construction method for these systems are proposed. As a corollary of our main result, our paper contains a solution of a Vakarelov's problem: how to construct a formal system that describes all the Boolean combinations of the basic relations.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 19
    Electronic Resource
    Electronic Resource
    Springer
    Studia logica 58 (1997), S. 129-141 
    ISSN: 1572-8730
    Keywords: fuzzy logic ; many-valued logic ; undecidability
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Philosophy
    Notes: Abstract A very simple many-valued predicate calculus is presented; a completeness theorem is proved and the arithmetical complexity of some notions concerning provability is determined.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 20
    Electronic Resource
    Electronic Resource
    Springer
    Studia logica 58 (1997), S. 143-184 
    ISSN: 1572-8730
    Keywords: approximate reasoning ; synthesis of complex objects ; rough sets ; mereology ; rough mereology
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Philosophy
    Notes: Abstract We are concerned with formal models of reasoning under uncertainty. Many approaches to this problem are known in the literature e.g. Dempster-Shafer theory [29], [42], bayesian-based reasoning [21], [29], belief networks [29], many-valued logics and fuzzy logics [6], non-monotonic logics [29], neural network logics [14]. We propose rough mereology developed by the last two authors [22-25] as a foundation for approximate reasoning about complex objects. Our notion of a complex object includes, among others, proofs understood as schemes constructed in order to support within our knowledge assertions/hypotheses about reality described by our knowledge incompletely.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 21
    Electronic Resource
    Electronic Resource
    Springer
    Studia logica 57 (1996), S. 279-302 
    ISSN: 1572-8730
    Keywords: temporal logic ; axiomatization ; first-order temporal/modal logics
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Philosophy
    Notes: Abstract We present an axiomatisation for the first-order temporal logic with connectives Until and Since over the class of all linear flows of time. Completeness of the axiom system is proved. We also add a few axioms to find a sound and complete axiomatisation for the first order temporal logic of Until and Since over rational numbers time.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 22
    Electronic Resource
    Electronic Resource
    Springer
    Studia logica 57 (1996), S. 325-354 
    ISSN: 1572-8730
    Keywords: infinitary predicate KD4 ; common knowledge ; Nash equilibrium ; undecidability on playability
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Philosophy
    Notes: Abstract This paper provides a logic framework for investigations of game theoretical problems. We adopt an infinitary extension of classical predicate logic as the base logic of the framework. The reason for an infinitary extension is to express the common knowledge concept explicitly. Depending upon the choice of axioms on the knowledge operators, there is a hierarchy of logics. The limit case is an infinitary predicate extension of modal propositional logic KD4, and is of special interest in applications. In Part I, we develop the basic framework, and show some applications: an epistemic axiomatization of Nash equilibrium and formal undecidability on the playability of a game. To show the formal undecidability, we use a term existence theorem, which will be proved in Part II.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 23
    Electronic Resource
    Electronic Resource
    Springer
    Studia logica 57 (1996), S. 459-459 
    ISSN: 1572-8730
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Philosophy
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 24
    Electronic Resource
    Electronic Resource
    Springer
    Studia logica 58 (1997), S. 79-97 
    ISSN: 1572-8730
    Keywords: MV algebra ; completeness of the Lukasiewicz calculus ; infinite-valued logic
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Philosophy
    Notes: Abstract The interpretation of propositions in Lukasiewicz's infinite-valued calculus as answers in Ulam's game with lies--the Boolean case corresponding to the traditional Twenty Questions game--gives added interest to the completeness theorem. The literature contains several different proofs, but they invariably require technical prerequisites from such areas as model-theory, algebraic geometry, or the theory of ordered groups. The aim of this paper is to provide a self-contained proof, only requiring the rudiments of algebra and convexity in finite-dimensional vector spaces.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 25
    Electronic Resource
    Electronic Resource
    Springer
    Studia logica 59 (1997), S. 149-177 
    ISSN: 1572-8730
    Keywords: modal logic ; transfer ; interpretation ; tense logic ; intuitionistic logic
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Philosophy
    Notes: Abstract This papers gives a survey of recent results about simulations of one class of modal logics by another class and of the transfer of properties of modal logics under extensions of the underlying modal language. We discuss: the transfer from normal polymodal logics to their fusions, the transfer from normal modal logics to their extensions by adding the universal modality, and the transfer from normal monomodal logics to minimal tense extensions. Likewise, we discuss simulations of normal polymodal logics by normal monomodal logics, of nominals and the difference operator by normal operators, of monotonic monomodal logics by normal bimodal logics, of polyadic normal modal logics by polymodal normal modal logics, and of intuitionistic modal logics by normal bimodal logics.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 26
    Electronic Resource
    Electronic Resource
    Springer
    Studia logica 59 (1997), S. 271-301 
    ISSN: 1572-8730
    Keywords: bimodal logics ; logics of knowledge ; branching time ; persistence ; convexity
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Philosophy
    Notes: Abstract This paper presents a bimodal logic for reasoning about knowledge during knowledge acquisitions. One of the modalities represents (effort during) non-deterministic time and the other represents knowledge. The semantics of this logic are tree-like spaces which are a generalization of semantics used for modeling branching time and historical necessity. A finite system of axiom schemes is shown to be canonically complete for the formentioned spaces. A characterization of the satisfaction relation implies the small model property and decidability for this system.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 27
    Electronic Resource
    Electronic Resource
    Springer
    Studia logica 60 (1998), S. 45-66 
    ISSN: 1572-8730
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Philosophy
    Notes: Abstract Symlog is a system for learning symbolic logic by computer that allows students to interactively construct proofs in Fitch-style natural deduction. On request, Symlog can provide guidance and advice to help a student narrow the gap between goal theorem and premises. To effectively implement this capability, the program was equipped with a theorem prover that constructs proofs using the same methods and techniques the students are being taught. This paper discusses some of the aspects of the theorem prover's design, including its set of proof-construction strategies, its unification algorithm as well as some of the tradeoffs between efficiency and pedagogy.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 28
    Electronic Resource
    Electronic Resource
    Springer
    Studia logica 59 (1997), S. 417-448 
    ISSN: 1572-8730
    Keywords: linear logic ; Curry-Howard isomorphism ; typed λ-calculi
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Philosophy
    Notes: Abstract The introduction of Linear Logic extends the Curry-Howard Isomorphism to intensional aspects of the typed functional programming. In particular, every formula of Linear Logic tells whether the term it is a type for, can be either erased/duplicated or not, during a computation. So, Linear Logic can be seen as a model of a computational environment with an explicit control about the management of resources. This paper introduces a typed functional language Λ! and a categorical model for it. The terms of Λ! encode a version of natural deduction for Intuitionistic Linear Logic such that linear and non linear assumptions are managed multiplicatively and additively, respectively. Correspondingly, the terms of Λ! are built out of two disjoint sets of variables. Moreover, the λ-abstractions of Λ! bind variables and patterns. The use of two different kinds of variables and the patterns allow a very compact definition of the one-step operational semantics of Λ!, unlike all other extensions of Curry-Howard Isomorphism to Intuitionistic Linear Logic. The language Λ! is Church-Rosser and enjoys both Strong Normalizability and Subject Reduction. The categorical model induces operational equivalences like, for example, a set of extensional equivalences. The paper presents also an untyped version of Λ! and a type assignment for it, using formulas of Linear Logic as types. The type assignment inherits from Λ! all the good computational properties and enjoys also the Principal-Type Property.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 29
    Electronic Resource
    Electronic Resource
    Springer
    Studia logica 60 (1998), S. 209-231 
    ISSN: 1572-8730
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Philosophy
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 30
    Electronic Resource
    Electronic Resource
    Springer
    Studia logica 60 (1998), S. 253-273 
    ISSN: 1572-8730
    Keywords: nonstandard set theory ; inner subuniverses ; constructibility ; iterated elementary extensions
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Philosophy
    Notes: Abstract In continuation of our study of HST, Hrbaček set theory (a nonstandard set theory which includes, in particular, the ZFC Replacement and Separation schemata in the st-∈-language, and Saturation for well-orderable families of internal sets), we consider the problem of existence of elementary extensions of inner "external" subclasses of the HST universe. We show that, given a standard cardinal κ, any set R ⊑ *κ generates an "internal" class S(R) of all sets standard relatively to elements of R, and an "external" class L[S(R)] of all sets constructible (in a sense close to the Gödel constructibility) from sets in S(R). We prove that under some mild saturation-like requirements for R the class L[S(R)] models a certain κ-version of HST including the principle of κ+-saturation; moreover, in this case L[S(R′)] is an elementary extension of L[S(R)] in the st-∈-language whenever sets R ⊑ R′ satisfy the requirements.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 31
    Electronic Resource
    Electronic Resource
    Springer
    Studia logica 60 (1998), S. 343-355 
    ISSN: 1572-8730
    Keywords: Horn sentence ; reduced product ; reduced power ; ultrapower ; and ultraproduct
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Philosophy
    Notes: Abstract Many results concerning the equivalence between a syntactic form of formulas and a model theoretic conditions are proven directly without using any form of a continuum hypothesis. In particular, it is demonstrated that any reduced product sentence is equivalent to a Horn sentence. Moreover, in any first order language without equality one now has that a reduced product sentence is equivalent to a Horn sentence and any sentence is equivalent to a Boolean combination of Horn sentences.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 32
    Electronic Resource
    Electronic Resource
    Springer
    Studia logica 60 (1998), S. 357-386 
    ISSN: 1572-8730
    Keywords: Modal logic ; definability ; irreflexivity rule ; characterization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Philosophy
    Notes: Abstract Negative definability ([18]) is an alternative way of defining classes of Kripke frames via a modal language, one that enables us, for instance, to define the class of irreflexive frames. Besides a list of closure conditions for negatively definable classes, the paper contains two main theorems. First, a characterization is given of negatively definable classes of (rooted) finite transitive Kripke frames and of such classes defined using both traditional (positive) and negative definitions. Second, we characterize the negatively definable classes of rooted general frames.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 33
    Electronic Resource
    Electronic Resource
    Springer
    Studia logica 61 (1998), S. 3-6 
    ISSN: 1572-8730
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Philosophy
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 34
    Electronic Resource
    Electronic Resource
    Springer
    Studia logica 60 (1998), S. 441-448 
    ISSN: 1572-8730
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Philosophy
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 35
    Electronic Resource
    Electronic Resource
    Springer
    Studia logica 60 (1998), S. 421-439 
    ISSN: 1572-8730
    Keywords: BCK-algebra ; commutative BCK-algebra ; poset with difference ; D-poset ; MV-algebra ; quantum MV-algebra ; orthoalgebra
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Philosophy
    Notes: Abstract We discuss the interrelations between BCK-algebras and posets with difference. Applications are given to bounded commutative BCK-algebras, difference posets, MV-algebras, quantum MV-algebras and orthoalgebras.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 36
    Electronic Resource
    Electronic Resource
    Springer
    Studia logica 61 (1998), S. 101-121 
    ISSN: 1572-8730
    Keywords: many-valued logic ; infinitely-valued logic ; distribution quantifiers ; distributive lattices ; semantic tableaux ; sequent calculi
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Philosophy
    Notes: Abstract We provide tools for a concise axiomatization of a broad class of quantifiers in many-valued logic, so-called distribution quantifiers. Although sound and complete axiomatizations for such quantifiers exist, their size renders them virtually useless for practical purposes. We show that for quantifiers based on finite distributive lattices compact axiomatizations can be obtained schematically. This is achieved by providing a link between skolemized signed formulas and filters/ideals in Boolean set lattices. Then lattice theoretic tools such as Birkhoff's representation theorem for finite distributive lattices are used to derive tableau-style axiomatizations of distribution quantifiers.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 37
    Electronic Resource
    Electronic Resource
    Springer
    Studia logica 61 (1998), S. 281-292 
    ISSN: 1572-8730
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Philosophy
    Notes: Abstract The Kripke-completeness and incompleteness of some intermediate predicate logics is established. In particular, we obtain a Kripke-incomplete logic (H* +A+D+K) where H* is the intuitionistic predicate calculus, A is a disjunction-free propositional formula, D = ∀x(P(x) V Q) ⊃ ∀xP(x) V Q, K = ¬¬∀x(P(x) V ¬P(x)) (the negative answer to a question of T. Shimura).
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 38
    Electronic Resource
    Electronic Resource
    Springer
    Studia logica 62 (1999), S. 269-282 
    ISSN: 1572-8730
    Keywords: duality theory in modal logic ; modal algebras ; generated frames ; subdirect irreducibility
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Philosophy
    Notes: Abstract The duality between general frames and modal algebras allows to transfer a problem about the relational (Kripke) semantics into algebraic terms, and conversely. We here deal with the conjecture: the modal algebra A is subdirectly irreducible (s.i.) if and only if the dual frame A* is generated. We show that it is false in general, and that it becomes true under some mild assumptions, which include the finite case and the case of K4. We also prove that a Kripke frame F is generated if and only if the dual algebra F* is s.i. The technical result is that A is s.i. when the set of points which generate the dual frame A* is not of zero measure.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 39
    Electronic Resource
    Electronic Resource
    Springer
    Studia logica 62 (1999), S. 283-289 
    ISSN: 1572-8730
    Keywords: Monotone functionals ; monotone majorizable functionals ; hereditarily majorizable functionals ; simply typed lambda-calculus ; extensionality ; Dialectica interpretation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Philosophy
    Notes: Abstract Several properties of monotone functionals (MF) and monotone majorizable functionals (MMF) used in the earlier work by the author and van de Pol are proved. It turns out that the terms of the simply typed lambda-calculus define MF, but adding primitive recursion, and even monotonic primitive recursion changes the situation: already λZ.Z(1 — sg) is not MMF. It is proved that extensionality is not Dialectica-realizable by MMF, and a simple example of a MF which is not hereditarily majorizable is given.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 40
    Electronic Resource
    Electronic Resource
    Springer
    Studia logica 62 (1999), S. 305-314 
    ISSN: 1572-8730
    Keywords: intuitionism ; Brouwerian counter examples ; continuum ; creating subject
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Philosophy
    Notes: Abstract The original Brouwerian counter examples were algorithmic in nature; after the introduction of choice sequences, Brouwer devised a version which did not depend on algorithms. This is the origin of the ‘creating subject’ technique. The method allowed stronger refutations of classical principles. Here it is used to show that ‘negative dense’ subsets of the continuum are indecomposable.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 41
    Electronic Resource
    Electronic Resource
    Springer
    Studia logica 62 (1999), S. 117-120 
    ISSN: 1572-8730
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Philosophy
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 42
    Electronic Resource
    Electronic Resource
    Springer
    Studia logica 62 (1999), S. 291-303 
    ISSN: 1572-8730
    Keywords: sequent calculus ; normal deduction ; cutfree deduction ; complete discharge convention
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Philosophy
    Notes: Abstract The paper discusses the relationship between normal natural deductions and cutfree proofs in Gentzen (sequent) calculi in the absence of term labeling. For Gentzen calculi this is the usual version; for natural deduction this is the version under the complete discharge convention, where open assumptions are always discharged as soon as possible. The paper supplements work by Mints, Pinto, Dyckhoff, and Schwichtenberg on the labeled calculi.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 43
    Electronic Resource
    Electronic Resource
    Springer
    Studia logica 62 (1999), S. 341-352 
    ISSN: 1572-8730
    Keywords: Basic Predicate Logic ; Intuitionistic Predicate Logic ; translation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Philosophy
    Notes: Abstract Basic Predicate Logic, BQC, is a proper subsystem of Intuitionistic Predicate Logic, IQC. For every formula ϕ in the language {∨, ∧, →, ⊤, ⊥, ∀, ∃}, we associate two sequences of formulas 〈ϕ0,ϕ1,...〉 and 〈ϕ0,ϕ1,...〉 in the same language. We prove that for every sequent ϕ ⇒ ψ, there are natural numbers m, n, such that IQC ⊢ ϕ ⇒ ψ, iff BQC ⊢ ϕn ⇒ ψm. Some applications of this translation are mentioned.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 44
    Electronic Resource
    Electronic Resource
    Springer
    Studia logica 62 (1999), S. 353-370 
    ISSN: 1572-8730
    Keywords: truth ; satisfaction class ; cut elimination
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Philosophy
    Notes: Abstract Some axiomatic theories of truth and related subsystems of second-order arithmetic are surveyed and shown to be conservative over their respective base theory. In particular, it is shown by purely finitistically means that the theory PA ÷ "there is a satisfaction class" and the theory FS↾ of [2] are conservative over PA.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 45
    Electronic Resource
    Electronic Resource
    Springer
    Studia logica 62 (1999), S. 315-340 
    ISSN: 1572-8730
    Keywords: generalized quantifier ; finite model theory
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Philosophy
    Notes: Abstract We prove some results about the limitations of the expressive power of quantifiers on finite structures. We define the concept of a bounded quantifier and prove that every relativizing quantifier which is bounded is already first-order definable (Theorem 3.8). We weaken the concept of congruence closed (see [6]) to weakly congruence closed by restricting to congruence relations where all classes have the same size. Adapting the concept of a thin quantifier (Caicedo [1]) to the framework of finite structures, we define the concept of a meager quantifier. We show that no proper extension of first-order logic by means of meager quantifiers is weakly congruence closed (Theorem 4.9). We prove the failure of the full congruence closure property for logics which extend first-order logic by means of meager quantifiers, arbitrary monadic quantifiers, and the Härtig quantifier (Theorem 6.1).
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 46
    Electronic Resource
    Electronic Resource
    Springer
    Studia logica 62 (1999), S. 371-398 
    ISSN: 1572-8730
    Keywords: Kripke frames ; p-morphisms ; axiomatizations ; covers
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Philosophy
    Notes: Abstract We define the concepts of minimal p-morphic image and basic p-morphism for transitive Kripke frames. These concepts are used to determine effectively the least number of variables necessary to axiomatize a tabular extension of K4, and to describe the covers and co-covers of such a logic in the lattice of the extensions of K4.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 47
    Electronic Resource
    Electronic Resource
    Springer
    Studia logica 62 (1999), S. 429-448 
    ISSN: 1572-8730
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Philosophy
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 48
    Electronic Resource
    Electronic Resource
    Springer
    Studia logica 62 (1999), S. 449-451 
    ISSN: 1572-8730
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Philosophy
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 49
    Electronic Resource
    Electronic Resource
    Springer
    Studia logica 63 (1999), S. 27-48 
    ISSN: 1572-8730
    Keywords: Proof-Theory ; Probability Logic ; metric between sentences and systems ; characteristic formula of a modal sequent
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Philosophy
    Notes: Abstract This paper is the first of a series of three articles that present the syntactic proof of the PA-completeness of the modal system G, by introducing suitable proof-theoretic objects, which also have an independent interest. We start from the syntactic PA-completeness of modal system GL-LIN, previously obtained in [7], [8], and so we assume to be working on modal sequents S which are GL-LIN-theorems. If S is not a G-theorem we define here a notion of syntactic metric d(S, G): we calculate a canonical characteristic fomula H of S (char(S)) so that ⊢G ∼ H → (∼S) and ⊢GL-LIN ∼ H, and the complexity σ of ∼ H gives the distance d(S, G) of S from G. Then, in order to produce the whole completeness proof as an induction on this d(S, G), we introduce the tree-interpretation of a modal sequent Q into PA, that sends the letters of Q into PA-formulas describing the properties of a GL-LIN-proof P of Q: It is also a d(*, G)-metric linked interpretation, since it will be applied to a proof-tree T of ∼ H with H = char(S) and σ(∼ H) = d(S, G).
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 50
    Electronic Resource
    Electronic Resource
    Springer
    Studia logica 63 (1999), S. 49-84 
    ISSN: 1572-8730
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Philosophy
    Notes: Abstract The problems that surround iterated contractions and expansions of beliefs are approached by studying hypertheories, a generalisation of Adam Grove's notion of systems of spheres. By using a language with dynamic and doxastic operators different ideas about the basic nature of belief change are axiomatised. It is shown that by imposing quite natural constraints on how hypertheories may change, the basic logics for belief change can be strengthened considerably to bring one closer to a theory of iterated belief change. It is then argued that the logic of expansion, in particular, cannot without loss of generality be strengthened any further to allow for a full logic of iterated belief change. To remedy this situation a notion of directed expansion is introduced that allows for a full logic of iterated belief change. The new operation is given an axiomatisation that is complete for linear hypertheories.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 51
    Electronic Resource
    Electronic Resource
    Springer
    Studia logica 63 (1999), S. 151-180 
    ISSN: 1572-8730
    Keywords: intuitionistic logic ; new logical constants ; Novikov completeness
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Philosophy
    Notes: Abstract Extending the language of the intuitionistic propositional logic Int with additional logical constants, we construct a wide family of extensions of Int with the following properties: (a) every member of this family is a maximal conservative extension of Int; (b) additional constants are independent in each of them.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 52
    Electronic Resource
    Electronic Resource
    Springer
    Studia logica 63 (1999), S. 181-212 
    ISSN: 1572-8730
    Keywords: substructural logic ; relevant logic ; cut-elimination
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Philosophy
    Notes: Abstract We introduce several restricted versions of the structural rules in the implicational fragment of Gentzen's sequent calculus LJ. For example, we permit the applications of a structural rule only if its principal formula is an implication. We investigate cut-eliminability and theorem-equivalence among various combinations of them. The results include new cut-elimination theorems for the implicational fragments of the following logics: relevant logic E, strict implication S4, and their neighbors (e.g., E-W and S4-W); BCI-logic, BCK-logic, relevant logic R, and the intuitionistic logic.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 53
    Electronic Resource
    Electronic Resource
    Springer
    Studia logica 63 (1999), S. 245-268 
    ISSN: 1572-8730
    Keywords: Proof-Theory ; Provability Logic ; countermodel of a sequent ; classification of arithmetical interpretations of modal logic
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Philosophy
    Notes: Abstract This paper is the second part of the syntactic demonstration of the Arithmetical Completeness of the modal system G, the first part of which is presented in [9]. Given a sequent S so that ⊢GL-LIN S, ⊬G S, and given its characteristic formula H = char(S), which expresses the non G-provability of S, we construct a canonical proof-tree T of ~ H in GL-LIN, the height of which is the distance d(S, G) of S from G. T is the syntactic countermodel of S with respect to Gand is a tool of general interest in Provability Logic, that allows some classification in the set of the arithmetical interpretations.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 54
    ISSN: 1572-8730
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Philosophy
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 55
    Electronic Resource
    Electronic Resource
    Springer
    Studia logica 63 (1999), S. 343-352 
    ISSN: 1572-8730
    Keywords: Basic Logic ; Bisimulation ; Kripke Model ; Persistence
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Philosophy
    Notes: Abstract We characterize the first-order formulas with one free variable that are preserved under bisimulation and persistence or strong persistence over the class of Kripke models with transitive frames and unary persistent predicates.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 56
    Electronic Resource
    Electronic Resource
    Springer
    Studia logica 63 (1999), S. 311-330 
    ISSN: 1572-8730
    Keywords: modal logic ; actuality indexed sentences
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Philosophy
    Notes: Abstract Some logical properties of modal languages in which actuality is expressible are investigated. It is argued that, if a sentence like 'Actually, Quine is a distinguished philosopher' is understood as a special case of world-indexed sentences (the index being the actual world), then actuality can be expressed only under strong modal assumptions. Some rival rigid and indexical approaches to actuality are discussed.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 57
    Electronic Resource
    Electronic Resource
    Springer
    Studia logica 63 (1999), S. 331-342 
    ISSN: 1572-8730
    Keywords: belief change ; belief revision ; success postulate ; non-prioritized revision ; choice function
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Philosophy
    Notes: Abstract We introduce a constructive model of selective belief revision in which it is possible to accept only a part of the input information. A selective revision operator ο is defined by the equality K ο α = K * f(α), where * is an AGM revision operator and f a function, typically with the property ⊢ α → f(α). Axiomatic characterizations are provided for three variants of selective revision.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 58
    Electronic Resource
    Electronic Resource
    Springer
    Studia logica 63 (1999), S. 301-310 
    ISSN: 1572-8730
    Keywords: Proof-Theory ; Provability Logic ; metric between sentences and systems ; PA-representation of the syntactic countrmodel of a modal sequent.
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Philosophy
    Notes: Abstract This paper is the final part of the syntactic demonstration of the Arithmetical Completeness of the modal system G; in the preceding parts [9] and [10] the tools for the proof were defined, in particular the notion of syntactic countermodel. Our strategy is: PA-completeness of G as a search for interpretations which force the distance between G and a GL-LIN-theorem to zero. If the GL-LIN-theorem S is not a G-theorem, we construct a formula H expressing the non G-provability of S, so that ⊢GL-LIN ∼ H and so that a canonical proof T of ∼ H in GL-LIN is a syntactic countermodel for S with respect to G, which has the height θ(T) equal to the distance d(S, G) of S from G. Then we define the interpretation ξ of S which represents the proof-tree T in PA. By induction on θ(T), we prove that ⊢PA Sξ and d(S, G) 〉 0 imply the inconsistency of PA.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 59
    Electronic Resource
    Electronic Resource
    Springer
    Studia logica 63 (1999), S. 417-448 
    ISSN: 1572-8730
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Philosophy
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 60
    Electronic Resource
    Electronic Resource
    Springer
    Studia logica 63 (1999), S. 353-385 
    ISSN: 1572-8730
    Keywords: strong completeness ; strong w-completeness ; completeness ; hypercanonicity ; extensive canonicity ; canonicity ; extensive w-canonicity ; w-canonicity
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Philosophy
    Notes: Abstract By using algebraic-categorical tools, we establish four criteria in order to disprove canonicity, strong completeness, w-canonicity and strong w-completeness, respectively, of an intermediate propositional logic. We then apply the second criterion in order to get the following result: all the logics defined by extra-intuitionistic one-variable schemata, except four of them, are not strongly complete. We also apply the fourth criterion in order to prove that the Gabbay-de Jongh logic D1 is not strongly w-complete.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 61
    Electronic Resource
    Electronic Resource
    Springer
    Studia logica 63 (1999), S. 387-416 
    ISSN: 1572-8730
    Keywords: super-intuitionistic predicate logics ; modal predicate logics ; Kripke semantics ; algebraic semantics ; disjunction property ; existence property
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Philosophy
    Notes: Abstract In so-called Kripke-type models, each sentence is assigned either to true or to false at each possible world. In this setting, every possible world has the two-valued Boolean algebra as the set of truth values. Instead, we take a collection of algebras each of which is attached to a world as the set of truth values at the world, and obtain an extended semantics based on the traditional Kripke-type semantics, which we call here the algebraic Kripke semantics. We introduce algebraic Kripke sheaf semantics for super-intuitionistic and modal predicate logics, and discuss some basic properties. We can state the Gödel-McKinsey-Tarski translation theorem within this semantics. Further, we show new results on super-intuitionistic predicate logics. We prove that there exists a continuum of super-intuitionistic predicate logics each of which has both of the disjunction and existence properties and moreover the same propositional fragment as the intuitionistic logic.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 62
    Electronic Resource
    Electronic Resource
    Springer
    Studia logica 8 (1958), S. 130-130 
    ISSN: 1572-8730
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Philosophy
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 63
    Electronic Resource
    Electronic Resource
    Springer
    Studia logica 8 (1958), S. 7-56 
    ISSN: 1572-8730
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Philosophy
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 64
    Electronic Resource
    Electronic Resource
    Springer
    Studia logica 8 (1958), S. 63-63 
    ISSN: 1572-8730
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Philosophy
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 65
    Electronic Resource
    Electronic Resource
    Springer
    Studia logica 8 (1958), S. 57-62 
    ISSN: 1572-8730
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Philosophy
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 66
    Electronic Resource
    Electronic Resource
    Springer
    Studia logica 8 (1958), S. 65-128 
    ISSN: 1572-8730
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Philosophy
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 67
    Electronic Resource
    Electronic Resource
    Springer
    Studia logica 8 (1958), S. 129-129 
    ISSN: 1572-8730
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Philosophy
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 68
    Electronic Resource
    Electronic Resource
    Springer
    Studia logica 8 (1958), S. 131-154 
    ISSN: 1572-8730
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Philosophy
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 69
    Electronic Resource
    Electronic Resource
    Springer
    Studia logica 8 (1958), S. 155-158 
    ISSN: 1572-8730
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Philosophy
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 70
    Electronic Resource
    Electronic Resource
    Springer
    Studia logica 8 (1958), S. 159-163 
    ISSN: 1572-8730
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Philosophy
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 71
    Electronic Resource
    Electronic Resource
    Springer
    Studia logica 8 (1958), S. 165-174 
    ISSN: 1572-8730
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Philosophy
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 72
    Electronic Resource
    Electronic Resource
    Springer
    Studia logica 8 (1958), S. 175-175 
    ISSN: 1572-8730
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Philosophy
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 73
    Electronic Resource
    Electronic Resource
    Springer
    Studia logica 8 (1958), S. 176-176 
    ISSN: 1572-8730
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Philosophy
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 74
    Electronic Resource
    Electronic Resource
    Springer
    Studia logica 8 (1958), S. 177-185 
    ISSN: 1572-8730
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Philosophy
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 75
    Electronic Resource
    Electronic Resource
    Springer
    Studia logica 8 (1958), S. 186-186 
    ISSN: 1572-8730
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Philosophy
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 76
    Electronic Resource
    Electronic Resource
    Springer
    Studia logica 8 (1958), S. 187-187 
    ISSN: 1572-8730
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Philosophy
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 77
    Electronic Resource
    Electronic Resource
    Springer
    Studia logica 8 (1958), S. 189-205 
    ISSN: 1572-8730
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Philosophy
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 78
    Electronic Resource
    Electronic Resource
    Springer
    Studia logica 8 (1958), S. 206-208 
    ISSN: 1572-8730
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Philosophy
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 79
    Electronic Resource
    Electronic Resource
    Springer
    Studia logica 8 (1958), S. 209-211 
    ISSN: 1572-8730
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Philosophy
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 80
    Electronic Resource
    Electronic Resource
    Springer
    Studia logica 8 (1958), S. 213-244 
    ISSN: 1572-8730
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Philosophy
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 81
    Electronic Resource
    Electronic Resource
    Springer
    Studia logica 8 (1958), S. 245-245 
    ISSN: 1572-8730
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Philosophy
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 82
    Electronic Resource
    Electronic Resource
    Springer
    Studia logica 8 (1958), S. 249-254 
    ISSN: 1572-8730
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Philosophy
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 83
    Electronic Resource
    Electronic Resource
    Springer
    Studia logica 8 (1958), S. 246-247 
    ISSN: 1572-8730
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Philosophy
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 84
    Electronic Resource
    Electronic Resource
    Springer
    Studia logica 8 (1958), S. 255-256 
    ISSN: 1572-8730
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Philosophy
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 85
    Electronic Resource
    Electronic Resource
    Springer
    Studia logica 8 (1958), S. 257-257 
    ISSN: 1572-8730
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Philosophy
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 86
    Electronic Resource
    Electronic Resource
    Springer
    Studia logica 8 (1958), S. 273-276 
    ISSN: 1572-8730
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Philosophy
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 87
    Electronic Resource
    Electronic Resource
    Springer
    Studia logica 8 (1958), S. 259-272 
    ISSN: 1572-8730
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Philosophy
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 88
    Electronic Resource
    Electronic Resource
    Springer
    Studia logica 8 (1958), S. 277-281 
    ISSN: 1572-8730
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Philosophy
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 89
    ISSN: 1572-8730
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Philosophy
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 90
    ISSN: 1572-8730
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Philosophy
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 91
    Electronic Resource
    Electronic Resource
    Springer
    Studia logica 8 (1958), S. 299-303 
    ISSN: 1572-8730
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Philosophy
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 92
    ISSN: 1572-8730
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Philosophy
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 93
    Electronic Resource
    Electronic Resource
    Springer
    Studia logica 8 (1958), S. 305-312 
    ISSN: 1572-8730
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Philosophy
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 94
    Electronic Resource
    Electronic Resource
    Springer
    Studia logica 8 (1958), S. 313-317 
    ISSN: 1572-8730
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Philosophy
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 95
    Electronic Resource
    Electronic Resource
    Springer
    Studia logica 8 (1958), S. 319-333 
    ISSN: 1572-8730
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Philosophy
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 96
    Electronic Resource
    Electronic Resource
    Springer
    Studia logica 8 (1958), S. 343-347 
    ISSN: 1572-8730
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Philosophy
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 97
    Electronic Resource
    Electronic Resource
    Springer
    Studia logica 8 (1958), S. 335-342 
    ISSN: 1572-8730
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Philosophy
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 98
    Electronic Resource
    Electronic Resource
    Springer
    Studia logica 2 (1955), S. 147-150 
    ISSN: 1572-8730
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Philosophy
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 99
    Electronic Resource
    Electronic Resource
    Springer
    Studia logica 2 (1955), S. 6-6 
    ISSN: 1572-8730
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Philosophy
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 100
    Electronic Resource
    Electronic Resource
    Springer
    Studia logica 2 (1955), S. 7-75 
    ISSN: 1572-8730
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Philosophy
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...