Results for 'Decorated partitions'

976 found
Order:
  1. Questions and Answers in an Orthoalgebraic Approach.Reinhard Blutner - 2012 - Journal of Logic, Language and Information 21 (3):237-277.
    Taking the lead from orthodox quantum theory, I will introduce a handy generalization of the Boolean approach to propositions and questions: the orthoalgebraic framework. I will demonstrate that this formalism relates to a formal theory of questions (or ‘observables’ in the physicist’s jargon). This theory allows formulating attitude questions, which normally are non-commuting, i.e., the ordering of the questions affects the answer behavior of attitude questions. Further, it allows the expression of conditional questions such as “If Mary reads the book, (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  2.  7
    Structure and Form in Design: Critical Ideas for Creative Practice.Michael Hann - 2012 - Berg.
    Introduction -- The fundamentals and their role in design -- Underneath it all -- Tiling the plane without gap or overlap -- Symmetry, patterns and fractals -- The stepping stone of Fibonacci and the harmony of a line divided -- Polyhedra, spheres and domes -- Structures and form in three dimensions -- Variations on a theme: modularity, closest packing and partitioning -- Structural analysis in the decorative arts, design and architecture -- A designer's framework.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark  
  3. Aesthetics in the 21st Century: Walter Derungs & Oliver Minder.Peter Burleigh - 2012 - Continent 2 (4):237-243.
    Located in Kleinbasel close to the Rhine, the Kaskadenkondensator is a place of mediation and experimental, research-and process-based art production with a focus on performance and performative expression. The gallery, founded in 1994, and located on the third floor of the former Sudhaus Warteck Brewery (hence cascade condenser), seeks to develop interactions between artists, theorists and audiences. Eight, maybe, nine or ten 40 litre bags of potting compost lie strewn about the floor of a high-ceilinged white washed hall. Dumped, split (...)
     
    Export citation  
     
    Bookmark  
  4.  28
    Set Partitions and the Meaning of the Same.R. Zuber - 2017 - Journal of Logic, Language and Information 26 (1):1-20.
    It is shown that the notion of the partition of a set can be used to describe in a uniform way the meaning of the expression the same, in its basic uses in transitive and ditransitive sentences. Some formal properties of the function denoted by the same, which follow from such a description are indicated. These properties indicate similarities and differences between functions denoted by the same and generalised quantifiers.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  5.  14
    Partitions and Their Afterlives: Violence, Memories, Living.Radhika Mohanram & Anindya Raychaudhuri (eds.) - 2019 - Rowman & Littlefield International.
    Partitions and their Afterlives engages with political partitions and how their aftermath affects the contemporary life of nations and their citizens.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark  
  6.  25
    Partition Forcing and Independent Families.Jorge A. Cruz-Chapital, Vera Fischer, Osvaldo Guzmán & Jaroslav Šupina - 2023 - Journal of Symbolic Logic 88 (4):1590-1612.
    We show that Miller partition forcing preserves selective independent families and P-points, which implies the consistency of $\mbox {cof}(\mathcal {N})=\mathfrak {a}=\mathfrak {u}=\mathfrak {i}<\mathfrak {a}_T=\omega _2$. In addition, we show that Shelah’s poset for destroying the maximality of a given maximal ideal preserves tight mad families and so we establish the consistency of $\mbox {cof}(\mathcal {N})=\mathfrak {a}=\mathfrak {i}=\omega _1<\mathfrak {u}=\mathfrak {a}_T=\omega _2$.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  7. Partition epistemology and arguments from analogy.Alex Levine - 2009 - Synthese 166 (3):593-600.
    Nineteenth and twentieth century philosophies of science have consistently failed to identify any rational basis for the compelling character of scientific analogies. This failure is particularly worrisome in light of the fact that the development and diffusion of certain scientific analogies, e.g. Darwin’s analogy between domestic breeds and naturally occurring species, constitute paradigm cases of good science. It is argued that the interactivist model, through the notion of a partition epistemology, provides a way to understand the persuasive character of compelling (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  8.  48
    Metalogical Decorations of Logical Diagrams.Lorenz Demey & Hans Smessaert - 2016 - Logica Universalis 10 (2-3):233-292.
    In recent years, a number of authors have started studying Aristotelian diagrams containing metalogical notions, such as tautology, contradiction, satisfiability, contingency, strong and weak interpretations of contrariety, etc. The present paper is a contribution to this line of research, and its main aims are both to extend and to deepen our understanding of metalogical diagrams. As for extensions, we not only study several metalogical decorations of larger and less widely known Aristotelian diagrams, but also consider metalogical decorations of another type (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   15 citations  
  9. Against partitioned Readings of reciprocals.Yoad Winter - manuscript
    In this paper we examine partitioned interpretations of sentences with reciprocal expressions. We study the availability of partitioned readings with definite subjects and proper name conjunctions, and show new evidence that partitioned interpretations of simple reciprocal sentences are independent of the semantics of the reciprocal expression, and are exclusively determined by the interpretation of the subject.
     
    Export citation  
     
    Bookmark   1 citation  
  10.  27
    Partition Genericity and Pigeonhole Basis Theorems.Benoit Monin & Ludovic Patey - 2024 - Journal of Symbolic Logic 89 (2):829-857.
    There exist two main notions of typicality in computability theory, namely, Cohen genericity and randomness. In this article, we introduce a new notion of genericity, called partition genericity, which is at the intersection of these two notions of typicality, and show that many basis theorems apply to partition genericity. More precisely, we prove that every co-hyperimmune set and every Kurtz random is partition generic, and that every partition generic set admits weak infinite subsets, for various notions of weakness. In particular, (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  11. Dynamic partitioning and the conventionality of kinds.Jeffrey A. Barrett - 2007 - Philosophy of Science 74 (4):527-546.
    Lewis sender‐receiver games illustrate how a meaningful term language might evolve from initially meaningless random signals (Lewis 1969; Skyrms 2006). Here we consider how a meaningful language with a primitive grammar might evolve in a somewhat more subtle sort of game. The evolution of such a language involves the co‐evolution of partitions of the physical world into what may seem, at least from the perspective of someone using the language, to correspond to canonical natural kinds. While the evolved language (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   49 citations  
  12.  20
    A Partition Theorem of $omega^{omega^{alpha}}$.Claribet Piña - 2018 - Notre Dame Journal of Formal Logic 59 (3):387-403.
    We consider finite partitions of the closure F¯ of an ωα-uniform barrier F. For each partition, we get a homogeneous set having both the same combinatorial and topological structure as F¯, seen as a subspace of the Cantor space 2N.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  13. Partition-theorems for causal decision theories.Jordan Howard Sobel - 1989 - Philosophy of Science 56 (1):70-93.
    Two partition-theorems are proved for a particular causal decision theory. One is restricted to a certain kind of partition of circumstances, and analyzes the utility of an option in terms of its utilities in conjunction with circumstances in this partition. The other analyzes an option's utility in terms of its utilities conditional on circumstances and is quite unrestricted. While the first form seems more useful for applications, the second form may be of theoretical importance in foundational exercises. Comparisons are made (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   12 citations  
  14.  55
    Stability and Efficiency of Partitions in Matching Problems.İpek Özkal-Sanver - 2005 - Theory and Decision 59 (3):193-205.
    We define two versions of stability and efficiency of partitions and analyze their relationships for some matching rules. The stability and efficiency of a partition depends on the matching rule φ. The results are stated under various membership property rights axioms. It is shown that in a world where agents can freely exit from and enter coalitions, whenever the matching rule is individually rational and Pareto optimal, the set of φ-stable and φ-efficient partitions coincide and it is unique: (...)
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  15.  65
    A partition property of a mixed type for P~k(Lambda).Pierre Matet - 2003 - Mathematical Logic Quarterly 49 (6):615.
    Given a regular infinite cardinal κ and a cardinal λ > κ, we study fine ideals H on Pκ that satisfy the square brackets partition relation equation image, where μ is a cardinal ≥2.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  16.  65
    Partition theorems and computability theory.Joseph R. Mileti - 2005 - Bulletin of Symbolic Logic 11 (3):411-427.
    The connections between mathematical logic and combinatorics have a rich history. This paper focuses on one aspect of this relationship: understanding the strength, measured using the tools of computability theory and reverse mathematics, of various partition theorems. To set the stage, recall two of the most fundamental combinatorial principles, König's Lemma and Ramsey's Theorem. We denote the set of natural numbers by ω and the set of finite sequences of natural numbers by ω<ω. We also identify each n ∈ ω (...)
    Direct download (11 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  17. Partition and revision: The semantics of counterfactuals.Angelika Kratzer - 1981 - Journal of Philosophical Logic 10 (2):201 - 216.
    The last section made it clear that an analysis which at first seems to fail is viable after all. It is viable if we let it depend on a partition function to be provided by the context of conversation. This analysis leaves certain traits of the partition function open. I have tried to show that this should be so. Specifying these traits as Pollock does leads to wrong predictions. And leaving them open endows counterfactuals with just the right amount of (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   77 citations  
  18. The partitive constraint in optimality theory.Anttila Arto & Fong Vivienne - 2000 - Journal of Semantics 17 (4).
     
    Export citation  
     
    Bookmark  
  19. Décor du petit cloître de la Chartreuse de Paris peint par Le Sueur: étude techique et historique des restaurations.Elisabeth Martin, Jacqueline Bret & Christiane Naffah - 1994 - Techne 1:85-102.
  20. Granular Partitions and Vagueness.Thomas Bittner & Barry Smith - 2001 - In Barry Smith & Christopher Welty (eds.), Formal Ontology in Information Systems (FOIS). ACM Press. pp. 309-320.
    There are some who defend a view of vagueness according to which there are intrinsically vague objects or attributes in reality. Here, in contrast, we defend a view of vagueness as a semantic property of names and predicates. All entities are crisp, on this view, but there are, for each vague name, multiple portions of reality that are equally good candidates for being its referent, and, for each vague predicate, multiple classes of objects that are equally good candidates for being (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  21. The partitioned quantum universe: Entanglement and the emergence of functionality.Gunter Mahler - 2004 - Mind and Matter 2 (2):67-89.
    Given that the world as we perceive it appears to be predominantly classical, how can we stabilize quantum effects? Given the fundamental description of our world is quantum mechanical, how do classical phenomena emerge? Answers can be found from the analysis of the scaling properties of modular quantum systems with respect to a given level of description. It is argued that, depending on design, such partitioned quantum systems may support various functions. Despite their local appearance these functions are emergent properties (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  22.  51
    Knowledge, partitioned sets and extensionality: A refutation of the forms of knowledge thesis.C. W. Evers & J. C. Walker - 1983 - Journal of Philosophy of Education 17 (2):155–170.
    C W Evers, J C Walker; Knowledge, Partitioned Sets and Extensionality: a refutation of the forms of knowledge thesis, Journal of Philosophy of Education, Volume.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   14 citations  
  23.  17
    Partition Complete Boolean Algebras and Almost Compact Cardinals.Peter Jipsen & Henry Rose - 1999 - Mathematical Logic Quarterly 45 (2):241-255.
    For an infinite cardinal K a stronger version of K-distributivity for Boolean algebras, called k-partition completeness, is defined and investigated . It is shown that every k-partition complete Boolean algebra is K-weakly representable, and for strongly inaccessible K these concepts coincide. For regular K ≥ u, it is proved that an atomless K-partition complete Boolean algebra is an updirected union of basic K-tree algebras. Using K-partition completeness, the concept of γ-almost compactness is introduced for γ ≥ K. For strongly inaccessible (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  24.  9
    Partitioning the Real Line Into Borel Sets.Will Brian - 2024 - Journal of Symbolic Logic 89 (2):549-568.
    For which infinite cardinals $\kappa $ is there a partition of the real line ${\mathbb R}$ into precisely $\kappa $ Borel sets? Work of Lusin, Souslin, and Hausdorff shows that ${\mathbb R}$ can be partitioned into $\aleph _1$ Borel sets. But other than this, we show that the spectrum of possible sizes of partitions of ${\mathbb R}$ into Borel sets can be fairly arbitrary. For example, given any $A \subseteq \omega $ with $0,1 \in A$, there is a forcing (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  25.  12
    Decoration on the Cult Chapel Walls of the Old Kingdom Tombs at Giza: A New Approach to Their Interaction. By Leo Roeten.Ronald J. Leprohon - 2021 - Journal of the American Oriental Society 138 (1).
    The Decoration on the Cult Chapel Walls of the Old Kingdom Tombs at Giza: A New Approach to Their Interaction. By Leo Roeten. Culture & History of the Ancient Near East, vol. 70. Leiden: Brill, 2014. Pp. lix + 436, illus. $218.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  26. A Theory of Granular Partitions.Thomas Bittner & Barry Smith - 2003 - In Matt Duckham, Michael F. Goodchild & Michael Worboys (eds.), Foundations of Geographic Information Science. London: Taylor & Francis. pp. 117-151.
    We have a variety of different ways of dividing up, classifying, mapping, sorting and listing the objects in reality. The theory of granular partitions presented here seeks to provide a general and unified basis for understanding such phenomena in formal terms that is more realistic than existing alternatives. Our theory has two orthogonal parts: the first is a theory of classification; it provides an account of partitions as cells and subcells; the second is a theory of reference or (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   53 citations  
  27.  49
    Schopenhauer’s Partition Diagrams and Logical Geometry.Jens Lemanski & Lorenz Demey - 2021 - In Stapleton G. Basu A. (ed.), Diagrams 2021: Diagrammatic Representation and Inference. pp. 149-165.
    The paper examines Schopenhauer’s complex diagrams from the Berlin Lectures of the 1820 s, which show certain partitions of classes. Drawing upon ideas and techniques from logical geometry, we show that Schopenhauer’s partition diagrams systematically give rise to a special type of Aristotelian diagrams, viz. (strong) α -structures.
    Direct download  
     
    Export citation  
     
    Bookmark   4 citations  
  28. Automatic Partitioning for Multi-Agent Reinforcement Learning.Ron Sun - unknown
    This paper addresses automatic partitioning in complex reinforcement learning tasks with multiple agents, without a priori domain knowledge regarding task structures. Partitioning a state/input space into multiple regions helps to exploit the di erential characteristics of regions and di erential characteristics of agents, thus facilitating learning and reducing the complexity of agents especially when function approximators are used. We develop a method for optimizing the partitioning of the space through experience without the use of a priori domain knowledge. The method (...)
     
    Export citation  
     
    Bookmark  
  29. Partition lies, Advaita Vedanta and Bhisham Sahni’s Tamas.Subhasis Chattopadhyay - 2016 - In Pinaki Roy & Ashim Kumar Sarkar (eds.), Portrayal of the Indian Partition in History, Literature, and Media.
    This is a re-look at the (Indian) Partition event through the lens of Advaita Vedanta.
    Direct download  
     
    Export citation  
     
    Bookmark  
  30.  15
    A Partition Theorem for a Randomly Selected Large Population.Arni S. R. Srinivasa Rao - 2021 - Acta Biotheoretica 70 (1):1-11.
    A theorem on the partitioning of a randomly selected large population into stationary and non-stationary components by using a property of the stationary population identity is stated and proved. The methods of partitioning demonstrated are original and these are helpful in real-world situations where age-wise data is available. Applications of this theorem for practical purposes are summarized at the end.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  31.  46
    Stable partitions in many division problems: the proportional and the sequential dictator solutions.Gustavo Bergantiños, Jordi Massó, Inés Moreno de Barreda & Alejandro Neme - 2015 - Theory and Decision 79 (2):227-250.
    We study how to partition a set of agents in a stable way when each coalition in the partition has to share a unit of a perfectly divisible good, and each agent has symmetric single-peaked preferences on the unit interval of his potential shares. A rule on the set of preference profiles consists of a partition function and a solution. Given a preference profile, a partition is selected and as many units of the good as the number of coalitions in (...)
    No categories
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark  
  32.  23
    Partition numbers.Otmar Spinas - 1997 - Annals of Pure and Applied Logic 90 (1-3):243-262.
    We continue [21] and study partition numbers of partial orderings which are related to /fin. In particular, we investigate Pf, be the suborder of /fin)ω containing only filtered elements, the Mathias partial order M, and , ω the lattice of partitions of ω, respectively. We show that Solomon's inequality holds for M and that it consistently fails for Pf. We show that the partition number of is C. We also show that consistently the distributivity number of ω is smaller (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   9 citations  
  33.  27
    Partition relations on a plain product order type.Jean A. Larson - 2006 - Annals of Pure and Applied Logic 144 (1-3):117-125.
    The goal of this short note is to interest set theorists in the order type ω*ω1, and to encourage them to work on the question of whether or not the Continuum Hypothesis decides the partition relation τ→2, for τ=ω*ω1 and for τ=ω1ω+2.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  34.  23
    The decorative scheme from the throne room of king Ashurnasirpal II palace.Philippe Racy Takla - 2009 - Archai: Revista de Estudos Sobre as Origens Do Pensamento Ocidental 2:61-76.
    We will present the main characteristics of the decorative scheme from throne room in the palace of the Neo-Assyrian king Ashurnasirpal II, whose reign extended from 883-859 BC, located in the ancient city of Kalhu, now north Iraq. We consider decorative scheme to be the presence of images and texts in an architectural setting. We believe that the creation of the decorative scheme may be in some way linked to political projects, and therefore, it would be an expression of the (...)
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  35.  23
    Additive partition of parametric information and its associated β-diversity measure.Carlo Ricotta - 2003 - Acta Biotheoretica 51 (2):91-100.
    A desirable property of a diversity index is strict concavity. This implies that the pooled diversity of a given community sample is greater than or equal to but not less than the weighted mean of the diversity values of the constituting plots. For a strict concave diversity index, such as species richness S, Shannon''s entropy H or Simpson''s index 1-D, the pooled diversity of a given community sample can be partitioned into two non-negative, additive components: average within-plot diversity and between-plot (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  36.  43
    Partition Principles and Infinite Sums of Cardinal Numbers.Masasi Higasikawa - 1995 - Notre Dame Journal of Formal Logic 36 (3):425-434.
    The Axiom of Choice implies the Partition Principle and the existence, uniqueness, and monotonicity of (possibly infinite) sums of cardinal numbers. We establish several deductive relations among those principles and their variants: the monotonicity follows from the existence plus uniqueness; the uniqueness implies the Partition Principle; the Weak Partition Principle is strictly stronger than the Well-Ordered Choice.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  37.  63
    Partitive Case and Aspect.Paul Kiparsky - unknown
    Current theories make a distinction between two types of case, STRUCTURAL case and INHERENT (or LEXICAL) case (Chomsky 1981), similar to the older distinction between GRAMMATICAL and SEMANTIC case (Kuryłowicz 1964).1 Structural case is assumed to be assigned at S-structure in a purely configurational way, whereas inherent case is assigned at D-structure in possible dependence on the governing predicates’s lexical properties. It is well known that not all cases fall cleanly into this typology. In particular, there is a class of (...)
    Direct download  
     
    Export citation  
     
    Bookmark   7 citations  
  38.  50
    Decorated linear order types and the theory of concatenation.Alasdair Urquhart & Albert Visser - 2010 - In Françoise Delon, Ulrich Kohlenbach, Penelope Maddy & Frank Stephan (eds.), Logic Colloquium 2007. New York: Cambridge University Press. pp. 1.
  39.  30
    Parameterized partition relations on the real numbers.Joan Bagaria & Carlos A. Di Prisco - 2009 - Archive for Mathematical Logic 48 (2):201-226.
    We consider several kinds of partition relations on the set ${\mathbb{R}}$ of real numbers and its powers, as well as their parameterizations with the set ${[\mathbb{N}]^{\mathbb{N}}}$ of all infinite sets of natural numbers, and show that they hold in some models of set theory. The proofs use generic absoluteness, that is, absoluteness under the required forcing extensions. We show that Solovay models are absolute under those forcing extensions, which yields, for instance, that in these models for every well ordered partition (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  40.  64
    Partitions and conditionals.Peter W. Woodruff - 1999 - Journal of Philosophical Logic 28 (2):113-128.
    The literature on conditionals is rife with alternate formulations of the abstract semantics of conditional logic. Each formulation has its own advantages in terms of applications and generalizations; nevertheless, they are for the most part equivalent, in the sense that they underwrite the same range of logical systems. The purpose of the present note is to bring under this umbrella the partition semantics introduced by Brian Skyrms in (Skyrms, 1984).
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  41.  19
    Minimum‐sized Infinite Partitions of Boolean Algebras.J. Donald Monk - 1996 - Mathematical Logic Quarterly 42 (1):537-550.
    For any Boolean Algebra A, let cmm be the smallest size of an infinite partition of unity in A. The relationship of this function to the 21 common functions described in Monk [4] is described, for the class of all Boolean algebras, and also for its most important subclasses. This description involves three main results: the existence of a rigid tree algebra in which cmm exceeds any preassigned number, a rigid interval algebra with that property, and the construction of an (...)
    Direct download  
     
    Export citation  
     
    Bookmark   2 citations  
  42.  10
    Partition of Large Subsets of Semigroups.Teng Zhang - forthcoming - Journal of Symbolic Logic.
    It is known that in an infinite very weakly cancellative semigroup with size $\kappa $, any central set can be partitioned into $\kappa $ central sets. Furthermore, if $\kappa $ contains $\lambda $ almost disjoint sets, then any central set contains $\lambda $ almost disjoint central sets. Similar results hold for thick sets, very thick sets and piecewise syndetic sets. In this article, we investigate three other notions of largeness: quasi-central sets, C-sets, and J-sets. We obtain that the statement applies (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  43. Partitions and Objective Indefiniteness.David Ellerman - manuscript
    Classical physics and quantum physics suggest two meta-physical types of reality: the classical notion of a objectively definite reality with properties "all the way down," and the quantum notion of an objectively indefinite type of reality. The problem of interpreting quantum mechanics (QM) is essentially the problem of making sense out of an objectively indefinite reality. These two types of reality can be respectively associated with the two mathematical concepts of subsets and quotient sets (or partitions) which are category-theoretically (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  44.  92
    The spectrum of partitions of a Boolean algebra.J. Donald Monk - 2001 - Archive for Mathematical Logic 40 (4):243-254.
    The main notion dealt with in this article is where A is a Boolean algebra. A partition of 1 is a family ofnonzero pairwise disjoint elements with sum 1. One of the main reasons for interest in this notion is from investigations about maximal almost disjoint families of subsets of sets X, especially X=ω. We begin the paper with a few results about this set-theoretical notion.Some of the main results of the paper are:• (1) If there is a maximal family (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  45. An Introduction to Partition Logic.David Ellerman - 2014 - Logic Journal of the IGPL 22 (1):94-125.
    Classical logic is usually interpreted as the logic of propositions. But from Boole's original development up to modern categorical logic, there has always been the alternative interpretation of classical logic as the logic of subsets of any given (nonempty) universe set. Partitions on a universe set are dual to subsets of a universe set in the sense of the reverse-the-arrows category-theoretic duality--which is reflected in the duality between quotient objects and subobjects throughout algebra. Hence the idea arises of a (...)
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark   16 citations  
  46.  47
    A short note on the logico-conceptual foundations of information theory in partition logic.David Ellerman - 2009 - The Reasoner 3 (7):4-5.
    A new logic of partitions has been developed that is dual to ordinary logic when the latter is interpreted as the logic of subsets of a fixed universe rather than the logic of propositions. For a finite universe, the logic of subsets gave rise to finite probability theory by assigning to each subset its relative size as a probability. The analogous construction for the dual logic of partitions gives rise to a notion of logical entropy that is precisely (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  47.  18
    Décors peints au plafond dans des maisons hellénistiques à Délos.Françoise Alabe - 2002 - Bulletin de Correspondance Hellénique 126 (1):231-263.
    Fragments of painted plaster found in the destruction layer of three first floor rooms in the House of Seals and of one first floor room of the House of the Sword had broken from the ceiling. They allow the restoration of the schema in the room of the House of the Sword and of two of the rooms in the House of Seals, the latter in colour. Composed of bands surrounding a quadrangular field, these décorations, evoking carpets stretched on the (...)
    No categories
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  48. Post-partition movement of population.Kazi S. Ahmad - 1965 - In Karl W. Linsenmann (ed.), Proceedings. St. Louis, Lutheran Academy for Scholarship. pp. 3--201.
    No categories
     
    Export citation  
     
    Bookmark  
  49.  5
    Polarized Partition Relations and Almost-Disjoint Functions.James E. Baumgartner - 1989 - In Jens Erik Fenstad, Ivan Timofeevich Frolov & Risto Hilpinen (eds.), Logic, methodology, and philosophy of science VIII: proceedings of the Eighth International Congress of Logic, Methodology, and Philosophy of Science, Moscow, 1987. New York, NY, U.S.A.: Sole distributors for the U.S.A. and Canada, Elsevier Science.
  50. Decorating Charleston Farmhouse : Bloomsbury's experiments in forms of life, work and art.Beate Söntgen - 2020 - In Sami R. Khatib (ed.), Critique--the stakes of form. Zurich: Diaphanes.
     
    Export citation  
     
    Bookmark  
1 — 50 / 976