This category needs an editor. We encourage you to help if you are qualified.
Volunteer, or read more about what this involves.
Related categories

6193 found
Order:
1 — 50 / 6193
  1. Realism, Model Theory, and Linguistic Semantics.B. Abbott & L. Hauser - unknown
    George Lakoff (in his book Women, Fire, and Dangerous Things(1987) and the paper "Cognitive semantics" (1988)) champions some radical foundational views. Strikingly, Lakoff opposes realism as a metaphysical position, favoring instead some supposedly mild form of idealism such as that recently espoused by Hilary Putnam, going under the name "internal realism." For what he takes to be connected reasons, Lakoff also rejects truth conditional model-theoretic semantics for natural language. This paper examines an argument, given by Lakoff, against realism and MTS. (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  2. Combinatorial Characterization of Pi^11-Indescribability in P{Kappa}Lambda.Yoshihiro Abe - 1998 - Archive for Mathematical Logic 37 (4):261-272.
    It is proved that $\Pi^1_1$ -indescribability in $P_{\kappa}\lambda$ can be characterized by combinatorial properties without taking care of cofinality of $\lambda$ . We extend Carr's theorem proving that the hypothesis $\kappa$ is $2^{\lambda^{<\kappa}}$ -Shelah is rather stronger than $\kappa$ is $\lambda$ -supercompact.
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  3. A Hierarchy of Filters Smaller Than CF_\ Kappa\ Lambda-->.Yoshihiro Abe - 1997 - Archive for Mathematical Logic 36 (6):385-397.
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    My bibliography   3 citations  
  4. Combinatorics for Small Ideals on Pkλ.Yoshihiro Abe - 1997 - Mathematical Logic Quarterly 43 (4):541-549.
    We study the distributivity of the bounded ideal on Pkλ and answer negatively to a question of Johnson in [13]. The size of non-normal ideals with the partition property is also studied.
    Remove from this list   Direct download (5 more)  
     
    Export citation  
     
    My bibliography  
  5. REVIEWS-Seven Papers-PkM.Yoshihiro Abe & Pierre Matet - 2002 - Bulletin of Symbolic Logic 8 (2):309-311.
    Remove from this list  
     
    Export citation  
     
    My bibliography  
  6. Notes on the Partition Property of {\ Mathcal {P} _\ Kappa\ Lambda}.Yoshihiro Abe & Toshimichi Usuba - 2012 - Archive for Mathematical Logic 51 (5-6):575-589.
    We investigate the partition property of ${\mathcal{P}_{\kappa}\lambda}$ . Main results of this paper are as follows: (1) If λ is the least cardinal greater than κ such that ${\mathcal{P}_{\kappa}\lambda}$ carries a (λ κ , 2)-distributive normal ideal without the partition property, then λ is ${\Pi^1_n}$ -indescribable for all n < ω but not ${\Pi^2_1}$ -indescribable. (2) If cf(λ) ≥ κ, then every ineffable subset of ${\mathcal{P}_{\kappa}\lambda}$ has the partition property. (3) If cf(λ) ≥ κ, then the completely ineffable ideal over (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  7. Generic Extensions and Elementary Embeddings.Claes Åberg - 1975 - Theoria 41 (2):96-104.
  8. Pour-El Marian B. And Richards J. Ian. Computability in Analysis and Physics. Perspectives in Mathematical Logic. Springer-Verlag, Berlin, Heidelberg, New York, Etc., 1989, Xi+ 206 Pp. [REVIEW]Oliver Aberth - 1991 - Journal of Symbolic Logic 56 (2):749-750.
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  9. Review: Marian B. Pour-El, J. Ian Richards, Computability in Analysis and Physics. [REVIEW]Oliver Aberth - 1991 - Journal of Symbolic Logic 56 (2):749-750.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  10. Boolean Rings.Alexander Abian - 1977 - Journal of Symbolic Logic 42 (4):588-589.
    Remove from this list   Direct download  
     
    Export citation  
     
    My bibliography   1 citation  
  11. On the Use of More Than Two-Element Boolean Valued Models.Alexander Abian - 1975 - Notre Dame Journal of Formal Logic 16 (4):555-564.
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  12. Nonstandard Models for Arithmetic and Analysis.Alexander Abian - 1974 - Studia Logica 33 (1):11 - 22.
    Remove from this list   Direct download (5 more)  
     
    Export citation  
     
    My bibliography  
  13. Categoricity of Denumerable Atomless Boolean Rings.Alexander Abian - 1972 - Studia Logica 30 (1):63 - 68.
  14. Tency of Some Partition Theorems for Continuous Colorings, and the Structure of K,-Dense Real Order Types KALANTARI, I. And WEITKAMP, G., Effective Topological Spaces I: A Definability Theory. [REVIEW]U. Abraham, M. Rubin & S. Shelah - 1985 - Annals of Pure and Applied Logic 29:325.
    Remove from this list  
     
    Export citation  
     
    My bibliography  
  15. REVIEWS-On the Consistency of Some Partition Theorems for Continuous Colorings.U. Abraham, M. Rubin, S. Shelah & J. Steprans - 2002 - Bulletin of Symbolic Logic 8 (2):303-305.
    Remove from this list  
     
    Export citation  
     
    My bibliography  
  16. Aronszajn Trees on ℵ2 and ℵ3.Uri Abraham - 1983 - Annals of Pure and Applied Logic 24 (3):213-230.
    Assuming the existence of a supercompact cardinal and a weakly compact cardinal above it, we provide a generic extension where there are no Aronszajn trees of height ω 2 or ω 3 . On the other hand we show that some large cardinal assumptions are necessary for such a consistency result.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    My bibliography   11 citations  
  17. On the Consistency of Some Partition Theorems for Continuous Colorings, and the Structure of ℵ< Sub> 1-Dense Real Order Types.Uri Abraham, Matatyahu Rubin & Saharon Shelah - 1985 - Annals of Pure and Applied Logic 29 (2):123-206.
    We present some techniques in c.c.c. forcing, and apply them to prove consistency results concerning the isomorphism and embeddability relations on the family of ℵ 1 -dense sets of real numbers. In this direction we continue the work of Baumgartner [2] who proved the axiom BA stating that every two ℵ 1 -dense subsets of R are isomorphic, is consistent. We e.g. prove Con). Let K H , be the set of order types of ℵ 1 -dense homogeneous subsets of (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    My bibliography   15 citations  
  18. A Δ< Sup> 2< Sub> 2 Well-Order of the Reals and Incompactness of< I> L(< I> QMM).Uri Abraham & Saharon Shelah - 1993 - Annals of Pure and Applied Logic 59 (1):1-32.
    Remove from this list   Direct download  
     
    Export citation  
     
    My bibliography  
  19. A Δ22 Well-Order of the Reals and Incompactness of L.Uri Abraham & Saharon Shelah - 1993 - Annals of Pure and Applied Logic 59 (1):1-32.
    A forcing poset of size 221 which adds no new reals is described and shown to provide a Δ22 definable well-order of the reals . The encoding of this well-order is obtained by playing with products of Aronszajn trees: some products are special while other are Suslin trees. The paper also deals with the Magidor–Malitz logic: it is consistent that this logic is highly noncompact.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    My bibliography   10 citations  
  20. Big Toy Models: Representing Physical Systems as Chu Spaces.Samson Abramsky - 2012 - Synthese 186 (3):697 - 718.
    We pursue a model-oriented rather than axiomatic approach to the foundations of Quantum Mechanics, with the idea that new models can often suggest new axioms. This approach has often been fruitful in Logic and Theoretical Computer Science. Rather than seeking to construct a simplified toy model, we aim for a 'big toy model', in which both quantum and classical systems can be faithfully represented—as well as, possibly, more exotic kinds of systems. To this end, we show how Chu spaces can (...)
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  21. A Game Semantics for Generic Polymorphism.Samson Abramsky & Radha Jagadeesan - 2005 - Annals of Pure and Applied Logic 133 (1-3):3-37.
    Genericity is the idea that the same program can work at many different data types. Longo, Milstead and Soloviev proposed to capture the inability of generic programs to probe the structure of their instances by the following equational principle: if two generic programs, viewed as terms of type , are equal at any given instance A[T], then they are equal at all instances. They proved that this rule is admissible in a certain extension of System F, but finding a semantically (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  22. Locally Countable Models of Σ1-Separation.Fred G. Abramson - 1981 - Journal of Symbolic Logic 46 (1):96 - 100.
    Let α be any countable admissible ordinal greater than ω. There is a transitive set A such that A is admissible, locally countable, On A = α, and A satisfies Σ 1 -separation. In fact, if B is any nonstandard model of $KP + \forall x \subseteq \omega$ (the hyperjump of x exists), the ordinal standard part of B is greater than ω, and every standard ordinal in B is countable in B, then HC B ∩ (standard part of B) (...)
    Remove from this list   Direct download (6 more)  
     
    Export citation  
     
    My bibliography  
  23. Σ1-Separation.Fred G. Abramson - 1979 - Journal of Symbolic Logic 44 (3):374 - 382.
    Let A be a standard transitive admissible set. Σ 1 -separation is the principle that whenever X and Y are disjoint Σ A 1 subsets of A then there is a Δ A 1 subset S of A such that $X \subseteq S$ and $Y \cap S = \varnothing$ . Theorem. If A satisfies Σ 1 -separation, then (1) If $\langle T_n\mid n is a sequence of trees on ω each of which has at most finitely many infinite paths in (...)
    Remove from this list   Direct download (6 more)  
     
    Export citation  
     
    My bibliography  
  24. Models Without Indiscernibles.Fred G. Abramson & Leo A. Harrington - 1978 - Journal of Symbolic Logic 43 (3):572-600.
    For T any completion of Peano Arithmetic and for n any positive integer, there is a model of T of size $\beth_n$ with no (n + 1)-length sequence of indiscernibles. Hence the Hanf number for omitting types over T, H(T), is at least $\beth_\omega$ . (Now, using an upper bound previously obtained by Julia Knight H (true arithmetic) is exactly $\beth_\omega$ ). If T ≠ true arithmetic, then $H(T) = \beth_{\omega1}$ . If $\delta \not\rightarrow (\rho)^{ , then any completion of (...)
    Remove from this list   Direct download (6 more)  
     
    Export citation  
     
    My bibliography   3 citations  
  25. Vaught’s Conjecture Without Equality.Nathanael Leedom Ackerman - 2015 - Notre Dame Journal of Formal Logic 56 (4):573-582.
    Suppose that $\sigma\in{\mathcal{L}}_{\omega _{1},\omega }$ is such that all equations occurring in $\sigma$ are positive, have the same set of variables on each side of the equality symbol, and have at least one function symbol on each side of the equality symbol. We show that $\sigma$ satisfies Vaught’s conjecture. In particular, this proves Vaught’s conjecture for sentences of $ {\mathcal{L}}_{\omega _{1},\omega }$ without equality.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  26. On Transferring Model Theoretic Theorems of $${\Mathcal{L}_{{\Infty},\Omega}}$$ L ∞, Ω in the Category of Sets to a Fixed Grothendieck Topos.Nathanael Leedom Ackerman - 2014 - Logica Universalis 8 (3-4):345-391.
    Working in a fixed Grothendieck topos Sh(C, J C ) we generalize \({\mathcal{L}_{{\infty},\omega}}\) to allow our languages and formulas to make explicit reference to Sh(C, J C ). We likewise generalize the notion of model. We then show how to encode these generalized structures by models of a related sentence of \({\mathcal{L}_{{\infty},\omega}}\) in the category of sets and functions. Using this encoding we prove analogs of several results concerning \({\mathcal{L}_{{\infty},\omega}}\) , such as the downward Löwenheim–Skolem theorem, the completeness theorem and (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  27. Review: A. S. Kahr, Edward F. Moore, Hao Wang, Entscheidungsproblem Reduced to the $Forallexistsforall$ Case. [REVIEW]W. Ackermann - 1962 - Journal of Symbolic Logic 27 (2):225-225.
  28. Jaśkowski S. Undecidability of First Order Sentences in the Theory of Free Groupoids. Fundamenta Mathematicae, Bd. 43 , S. 36–45. [REVIEW]W. Ackermann - 1958 - Journal of Symbolic Logic 23 (4):445.
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  29. Review: A. Janiczak, Undecidability of Some Simple Formalized Theories. [REVIEW]Wilhelm Ackermann - 1957 - Journal of Symbolic Logic 22 (2):217-217.
    Remove from this list   Direct download  
     
    Export citation  
     
    My bibliography  
  30. Review: Julia Robinson, Existential Definability in Arithmetic. [REVIEW]Wilhelm Ackermann - 1955 - Journal of Symbolic Logic 20 (2):182-183.
    Remove from this list   Direct download  
     
    Export citation  
     
    My bibliography  
  31. Quantifiers, Games and Inductive Definitions.Peter Aczel - 1975 - In Stig Kanger (ed.), Journal of Symbolic Logic. Elsevier. pp. 1--14.
    Remove from this list   Direct download  
     
    Export citation  
     
    My bibliography   2 citations  
  32. Are There Enough Injective Sets?Peter Aczel, Benno van den Berg, Johan Granström & Peter Schuster - 2013 - Studia Logica 101 (3):467-482.
  33. Review: V. V. Vojtišék, Ob Odnom Podhode K Klassifikacii Bulevyh Funkcij (On an Approach to the Classification of Boolean Functions). [REVIEW]A. Ádám - 1970 - Journal of Symbolic Logic 35 (4):593-593.
  34. Review: G. N. Povarov, On the Group Invariance of Boolean Functions. [REVIEW]A. Adam - 1970 - Journal of Symbolic Logic 35 (1):161-162.
  35. Finitary Sketches.J. Adámek, P. T. Johnstone, J. A. Makowsky & J. Rosický - 1997 - Journal of Symbolic Logic 62 (3):699-707.
    Finitary sketches, i.e., sketches with finite-limit and finite-colimit specifications, are proved to be as strong as geometric sketches, i.e., sketches with finite-limit and arbitrary colimit specifications. Categories sketchable by such sketches are fully characterized in the infinitary first-order logic: they are axiomatizable by σ-coherent theories, i.e., basic theories using finite conjunctions, countable disjunctions, and finite quantifications. The latter result is absolute; the equivalence of geometric and finitary sketches requires (in fact, is equivalent to) the non-existence of measurable cardinals.
    Remove from this list   Direct download (7 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  36. On Quasivarieties and Varieties as Categories.Jiří Adámek - 2004 - Studia Logica 78 (1-2):7 - 33.
    Finitary quasivarieties are characterized categorically by the existence of colimits and of an abstractly finite, regularly projective regular generator G. Analogously, infinitary quasivarieties are characterized: one drops the assumption that G be abstractly finite. For (finitary) varieties the characterization is similar: the regular generator is assumed to be exactly projective, i.e., hom(G, –) is an exact functor. These results sharpen the classical characterization theorems of Lawvere, Isbell and other authors.
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  37. A Contribution to the End-Extension Problem and the Π1 Conservativeness Problem.Zofia Adamowicz - 1993 - Annals of Pure and Applied Logic 61 (1-2):3-48.
    We formulate a Π1 sentence τ which is a version of the Tableau consistency of GlΔ0. The sentence τ is true and is provable in GlΔ0 + exp. We construct a model M of GlΔ0+Ω1+τ+BGs1 which has no proper end-extension to a model of GlΔ0+Ω1+τ. Also we prove that GlΔ0+Ω1+τ is not Π1 conservative over GlΔ0+τ.
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    My bibliography   2 citations  
  38. A Sharp Version of the Bounded Matijasevich Conjecture and the End- Extension Problem.Zofia Adamowicz - 1992 - Journal of Symbolic Logic 57 (2):597-616.
    Remove from this list   Direct download (7 more)  
     
    Export citation  
     
    My bibliography   3 citations  
  39. On Maximal Theories.Zofia Adamowicz - 1991 - Journal of Symbolic Logic 56 (3):885-890.
    Remove from this list   Direct download (6 more)  
     
    Export citation  
     
    My bibliography   2 citations  
  40. On Finite Lattices of Degrees of Constructibility.Zofia Adamowicz - 1977 - Journal of Symbolic Logic 42 (3):349-371.
    Remove from this list   Direct download (6 more)  
     
    Export citation  
     
    My bibliography  
  41. One More Aspect of Forcing and Omitting Types.Zofia Adamowicz - 1976 - Journal of Symbolic Logic 41 (1):73-80.
    Remove from this list   Direct download (7 more)  
     
    Export citation  
     
    My bibliography  
  42. On Finite Lattices of Degrees of Constructibility of Reals.Zofia Adamowicz - 1976 - Journal of Symbolic Logic 41 (2):313-322.
    Remove from this list   Direct download (7 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  43. Existentially Closed Structures and Gödel's Second Incompleteness Theorem.Zofia Adamowicz & Teresa Bigorajska - 2001 - Journal of Symbolic Logic 66 (1):349-356.
    We prove that any 1-closed (see def 1.1) model of the Π 2 consequences of PA satisfies ¬Cons PA which gives a proof of the second Godel incompleteness theorem without the use of the Godel diagonal lemma. We prove a few other theorems by the same method.
    Remove from this list   Direct download (7 more)  
     
    Export citation  
     
    My bibliography   4 citations  
  44. Existentially Closed Models in the Framework of Arithmetic.Zofia Adamowicz, Andrés Cordón-Franco & F. Félix Lara-martín - 2016 - Journal of Symbolic Logic 81 (2):774-788.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  45. Open Questions Related to the Problem of Birkhoff and Maltsev.M. E. Adams, K. V. Adaricheva, W. Dziobiak & A. V. Kravchenko - 2004 - Studia Logica 78 (1-2):357-378.
    The Birkhoff-Maltsev problem asks for a characterization of those lattices each of which is isomorphic to the lattice L(K) of all subquasivarieties for some quasivariety K of algebraic systems. The current status of this problem, which is still open, is discussed. Various unsolved questions that are related to the Birkhoff-Maltsev problem are also considered, including ones that stem from the theory of propositional logics.
    Remove from this list   Direct download (5 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  46. Joins of Minimal Quasivarieties.M. E. Adams & W. Dziobiak - 1995 - Studia Logica 54 (3):371 - 389.
    LetL(K) denote the lattice (ordered by inclusion) of quasivarieties contained in a quasivarietyK and letD 2 denote the variety of distributive (0, 1)-lattices with 2 additional nullary operations. In the present paperL(D 2) is described. As a consequence, ifM+N stands for the lattice join of the quasivarietiesM andN, then minimal quasivarietiesV 0,V 1, andV 2 are given each of which is generated by a 2-element algebra and such that the latticeL(V 0+V1), though infinite, still admits an easy and nice description (...)
    Remove from this list   Direct download (5 more)  
     
    Export citation  
     
    My bibliography   2 citations  
  47. A Note on Two-Cardinal Models.Alan Adamson - 1983 - Mathematical Logic Quarterly 29 (4):193-196.
  48. Saturated Structures, Unions of Chains, and Preservation Theorems.Alan Adamson - 1980 - Annals of Mathematical Logic 19 (1-2):67-96.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  49. Unsolvability of Certain Algorithmic Problems in the Theory of Groups.S. I. Adan - 1965 - Journal of Symbolic Logic 30 (3):391-391.
    Remove from this list   Direct download  
     
    Export citation  
     
    My bibliography  
  50. On the Structure of Lattices of Subquasivarieties of Congruence-Noetherian Quasivarieties.K. V. Adaricheva & V. A. Gorbunov - 2004 - Studia Logica 78 (1-2):35 - 44.
    We study the structure of algebraic -closed subsets of an algebraic lattice L, where is some Browerian binary relation on L, in the special case when the lattice of such subsets is an atomistic lattice. This gives an approach to investigate the atomistic lattices of congruence-Noetherian quasivarieties.
    Remove from this list   Direct download (5 more)  
     
    Export citation  
     
    My bibliography  
1 — 50 / 6193