Results for 'Vollständigkeit Completeness'

952 found
Order:
  1.  27
    (1 other version)Complete Issue.Complete Issue - 2022 - Architecture Philosophy 5 (2).
    Direct download  
     
    Export citation  
     
    Bookmark  
  2.  6
    Lie algebra labels,[1,\ A 11 B] I if ABC 11 C.A. L. Completing - 2010 - In Harald Fritzsch & K. K. Phua, Proceedings of the Conference in Honour of Murray Gell-Mann's 80th Birthday. World Scientific. pp. 74.
    Direct download  
     
    Export citation  
     
    Bookmark  
  3. Er caianiello1.Completely Solved - 1986 - In G. Palm & A. Aertsen, Brain Theory. Springer. pp. 147.
    No categories
     
    Export citation  
     
    Bookmark  
  4. Table Des matieres editorial preface 3.Jair Minoro Abe, Curry Algebras Pt, Paraconsistent Logic, Newton Ca da Costa, Otavio Bueno, Jacek Pasniczek, Beyond Consistent, Complete Possible Worlds, Vm Popov & Inverse Negation - 1998 - Logique Et Analyse 41:1.
    No categories
     
    Export citation  
     
    Bookmark  
  5. Godabarisha Mishra.Complete Works ofSwami Vivekananda - 2007 - In Rekha Jhanji, The philosophy of Vivekananda. New Delhi: Aryan Books International.
    No categories
     
    Export citation  
     
    Bookmark  
  6. Amodal completion and relationalism.Bence Nanay - 2022 - Philosophical Studies 179 (8):2537-2551.
    Amodal completion is usually characterized as the representation of those parts of the perceived object that we get no sensory stimulation from. In the case of the visual sense modality, for example, amodal completion is the representation of occluded parts of objects we see. I argue that relationalism about perception, the view that perceptual experience is constituted by the relation to the perceived object, cannot give a coherent account of amodal completion. The relationalist has two options: construe the perceptual relation (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  7. Amodal completion and knowledge.Grace Helton & Bence Nanay - 2019 - Analysis 79 (3):415-423.
    Amodal completion is the representation of occluded parts of perceived objects. We argue for the following three claims: First, at least some amodal completion-involved experiences can ground knowledge about the occluded portions of perceived objects. Second, at least some instances of amodal completion-grounded knowledge are not sensitive, that is, it is not the case that in the nearest worlds in which the relevant claim is false, that claim is not believed true. Third, at least some instances of amodal completion-grounded knowledge (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   11 citations  
  8. (1 other version)A completeness theorem in modal logic.Saul Kripke - 1959 - Journal of Symbolic Logic 24 (1):1-14.
  9. The Complete Epistemic Subject and the Unity of Human Knowing.Philip Peterson - 1992 - Dissertation, University of Toronto (Canada)
    This thesis offers a re-definition of Kantian a priorism by expanding the notions surrounding it from within a Piagetian genetic epistemological viewpoint. ;In particular, the notion of "noumenon" is re-examined from within this viewpoint, and extended to all structural facets of the genetic epistemological knowing "situation". ;By means of these re-examinations of classical epistemological notions, the various forms of knowledge characteristically produced from within the bounds of that knowing "situation" can then be structurally located with respect to intent and focus (...)
     
    Export citation  
     
    Bookmark  
  10. (1 other version)Completeness in the theory of types.Leon Henkin - 1950 - Journal of Symbolic Logic 15 (2):81-91.
  11.  7
    The Complete Writing Guide to Nih Behavioral Science Grants.Lawrence M. Scheier & William L. Dewey (eds.) - 2007 - Oxford University Press USA.
    A veritable cookbook for individuals or corporations seeking funding from the federal government, The Complete Writing Guide to NIH Behavioral Science Grants contains the latest in technical information on NIH grants, including the new electronic submission process. Some of the most successful grant writers in history have contributed to this volume, offering key strategies as well as tips and suggestions in areas that are normally hard to find in grant writing guides, such as budgeting, human subjects, and power analysis. A (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  12. Completeness and decidability of three logics of counterfactual conditionals.David Lewis - 1971 - Theoria 37 (1):74-85.
  13. Quick completeness proofs for some logics of conditionals.John P. Burgess - 1981 - Notre Dame Journal of Formal Logic 22 (1):76-84.
  14.  44
    Structural Completeness in Substructural Logics.J. S. Olson, J. G. Raftery & C. J. Van Alten - 2008 - Logic Journal of the IGPL 16 (5):453-495.
    Hereditary structural completeness is established for a range of substructural logics, mainly without the weakening rule, including fragments of various relevant or many-valued logics. Also, structural completeness is disproved for a range of systems, settling some previously open questions.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   27 citations  
  15. Completeness and the Ends of Axiomatization.Michael Detlefsen - 2014 - In Juliette Kennedy, Interpreting Gödel: Critical Essays. Cambridge: Cambridge University Press. pp. 59-77.
    The type of completeness Whitehead and Russell aimed for in their Principia Mathematica was what I call descriptive completeness. This is completeness with respect to the propositions that have been proved in traditional mathematics. The notion of completeness addressed by Gödel in his famous work of 1930 and 1931 was completeness with respect to the truths expressible in a given language. What are the relative significances of these different conceptions of completeness for traditional mathematics? (...)
     
    Export citation  
     
    Bookmark   8 citations  
  16. Laws and the Completeness of the Fundamental.Martin Glazier - 2016 - In Mark Jago, Reality Making. Oxford, United Kingdom: Oxford University Press UK. pp. 11-37.
    Any explanation of one fact in terms of another will appeal to some sort of connection between the two. In a causal explanation, the connection might be a causal mechanism or law. But not all explanations are causal, and neither are all explanatory connections. For example, in explaining the fact that a given barn is red in terms of the fact that it is crimson, we might appeal to a non-causal connection between things’ being crimson and their being red. Many (...)
    Direct download  
     
    Export citation  
     
    Bookmark   41 citations  
  17. Completeness of an ancient logic.John Corcoran - 1972 - Journal of Symbolic Logic 37 (4):696-702.
    In previous articles, it has been shown that the deductive system developed by Aristotle in his "second logic" is a natural deduction system and not an axiomatic system as previously had been thought. It was also stated that Aristotle's logic is self-sufficient in two senses: First, that it presupposed no other logical concepts, not even those of propositional logic; second, that it is (strongly) complete in the sense that every valid argument expressible in the language of the system is deducible (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   85 citations  
  18.  79
    Structural Completeness in Fuzzy Logics.Petr Cintula & George Metcalfe - 2009 - Notre Dame Journal of Formal Logic 50 (2):153-182.
    Structural completeness properties are investigated for a range of popular t-norm based fuzzy logics—including Łukasiewicz Logic, Gödel Logic, Product Logic, and Hájek's Basic Logic—and their fragments. General methods are defined and used to establish these properties or exhibit their failure, solving a number of open problems.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   17 citations  
  19.  54
    Halldén Completeness for Relevant Modal Logics.Takahiro Seki - 2015 - Notre Dame Journal of Formal Logic 56 (2):333-350.
    Halldén completeness closely resembles the relevance property. To prove Halldén completeness in terms of Kripke-style semantics, the van Benthem–Humberstone theorem is often used. In relevant modal logics, the Halldén completeness of Meyer–Fuhrmann logics has been obtained using the van Benthem–Humberstone theorem. However, there remain a number of Halldén-incomplete relevant modal logics. This paper discusses the Halldén completeness of a wider class of relevant modal logics, namely, those with some Sahlqvist axioms.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  20. AI-Completeness: Using Deep Learning to Eliminate the Human Factor.Kristina Šekrst - 2020 - In Sandro Skansi, Guide to Deep Learning Basics. Springer. pp. 117-130.
    Computational complexity is a discipline of computer science and mathematics which classifies computational problems depending on their inherent difficulty, i.e. categorizes algorithms according to their performance, and relates these classes to each other. P problems are a class of computational problems that can be solved in polynomial time using a deterministic Turing machine while solutions to NP problems can be verified in polynomial time, but we still do not know whether they can be solved in polynomial time as well. A (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  21.  62
    Completeness of relevant quantification theories.Robert K. Meyer, J. Michael Dunn & Hugues Leblanc - 1974 - Notre Dame Journal of Formal Logic 15 (1):97-121.
  22. Completeness and super-valuations.Gary M. Hardegree - 2005 - Journal of Philosophical Logic 34 (1):81 - 95.
    This paper uses the notion of Galois-connection to examine the relation between valuation-spaces and logics. Every valuation-space gives rise to a logic, and every logic gives rise to a valuation space, where the resulting pair of functions form a Galois-connection, and the composite functions are closure-operators. A valuation-space (resp., logic) is said to be complete precisely if it is Galois-closed. Two theorems are proven. A logic is complete if and only if it is reflexive and transitive. A valuation-space is complete (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   21 citations  
  23.  19
    δ-Complete Decision Procedures for Satisfiability over the Reals.Sicun Gao, Jeremy Avigad & Edmund M. Clarke - unknown
    We introduce the notion of “δ-complete decision procedures” for solving SMT problems over the real numbers, with the aim of handling a wide range of nonlinear functions including transcendental functions and solutions of Lipschitz-continuous ODEs. Given an SMT problemϕ and a positive rational number δ, a δ-complete decision procedure determines either that ϕ is unsatisfiable, or that the “δ-weakening” of ϕ is satisfiable. Here, the δ-weakening of ϕ is a variant of ϕ that allows δ-bounded numerical perturbations on ϕ. We (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  24.  64
    Quotient Completion for the Foundation of Constructive Mathematics.Maria Emilia Maietti & Giuseppe Rosolini - 2013 - Logica Universalis 7 (3):371-402.
    We apply some tools developed in categorical logic to give an abstract description of constructions used to formalize constructive mathematics in foundations based on intensional type theory. The key concept we employ is that of a Lawvere hyperdoctrine for which we describe a notion of quotient completion. That notion includes the exact completion on a category with weak finite limits as an instance as well as examples from type theory that fall apart from this.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   11 citations  
  25.  48
    Functional Completeness and Axiomatizability within Belnap's Four-Valued Logic and its Expansions.Alexej P. Pynko - 1999 - Journal of Applied Non-Classical Logics 9 (1):61-105.
    In this paper we study 12 four-valued logics arisen from Belnap's truth and/or knowledge four-valued lattices, with or without constants, by adding one or both or none of two new non-regular operations—classical negation and natural implication. We prove that the secondary connectives of the bilattice four-valued logic with bilattice constants are exactly the regular four-valued operations. Moreover, we prove that its expansion by any non-regular connective (such as, e.g., classical negation or natural implication) is strictly functionally complete. Further, finding axiomatizations (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   32 citations  
  26.  47
    Containment Logics: Algebraic Completeness and Axiomatization.Stefano Bonzio & Michele Pra Baldi - 2021 - Studia Logica 109 (5):969-994.
    The paper studies the containment companion of a logic \. This consists of the consequence relation \ which satisfies all the inferences of \, where the variables of the conclusion are contained into those of the set of premises, in case this is not inconsistent. In accordance with the work started in [10], we show that a different generalization of the Płonka sum construction, adapted from algebras to logical matrices, allows to provide a matrix-based semantics for containment logics. In particular, (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   10 citations  
  27.  88
    Completeness and categoricty, part II: 20th century metalogic to 21st century semantics.Steve Awodey & Erich H. Reck - 2002 - History and Philosophy of Logic 23 (1):77-92.
    This paper is the second in a two-part series in which we discuss several notions of completeness for systems of mathematical axioms, with special focus on their interrelations and historical origins in the development of the axiomatic method. We argue that, both from historical and logical points of view, higher-order logic is an appropriate framework for considering such notions, and we consider some open questions in higher-order axiomatics. In addition, we indicate how one can fruitfully extend the usual set-theoretic (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   22 citations  
  28. Artwork completion: a response to Gover.Kelly Trogdon & Paisley Nathan Livingston - 2015 - Journal of Aesthetics and Art Criticism 73 (4):460-462.
    Response to Gover (2015) on Trogdon and Livingston (2015) on artwork completion.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  29. Expressivity and completeness for public update logics via reduction axioms.Barteld Kooi - 2007 - Journal of Applied Non-Classical Logics 17 (2):231-253.
    In this paper, we present several extensions of epistemic logic with update operators modelling public information change. Next to the well-known public announcement operators, we also study public substitution operators. We prove many of the results regarding expressivity and completeness using so-called reduction axioms. We develop a general method for using reduction axioms and apply it to the logics at hand.
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark   33 citations  
  30. Completeness of S4 for the Lebesgue Measure Algebra.Tamar Lando - 2012 - Journal of Philosophical Logic 41 (2):287-316.
    We prove completeness of the propositional modal logic S 4 for the measure algebra based on the Lebesgue-measurable subsets of the unit interval, [0, 1]. In recent talks, Dana Scott introduced a new measure-based semantics for the standard propositional modal language with Boolean connectives and necessity and possibility operators, and . Propositional modal formulae are assigned to Lebesgue-measurable subsets of the real interval [0, 1], modulo sets of measure zero. Equivalence classes of Lebesgue-measurable subsets form a measure algebra, , (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   9 citations  
  31.  86
    Games and full completeness for multiplicative linear logic.Abramsky Samson & Jagadeesan Radha - 1994 - Journal of Symbolic Logic 59 (2):543-574.
    We present a game semantics for Linear Logic, in which formulas denote games and proofs denote winning strategies. We show that our semantics yields a categorical model of Linear Logic and prove full completeness for Multiplicative Linear Logic with the MIX rule: every winning strategy is the denotation of a unique cut-free proof net. A key role is played by the notion of history-free strategy; strong connections are made between history-free strategies and the Geometry of Interaction. Our semantics incorporates (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   37 citations  
  32.  58
    The completeness of Stoic propositional logic.Ian Mueller - 1979 - Notre Dame Journal of Formal Logic 20 (1):201-215.
  33.  74
    Complete additivity and modal incompleteness.Wesley H. Holliday & Tadeusz Litak - 2019 - Review of Symbolic Logic 12 (3):487-535.
    In this article, we tell a story about incompleteness in modal logic. The story weaves together an article of van Benthem, “Syntactic aspects of modal incompleteness theorems,” and a longstanding open question: whether every normal modal logic can be characterized by a class of completely additive modal algebras, or as we call them, ${\cal V}$-baos. Using a first-order reformulation of the property of complete additivity, we prove that the modal logic that starred in van Benthem’s article resolves the open question (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  34.  85
    Husserl on completeness, definitely.Mirja Hartimo - 2018 - Synthese 195 (4):1509-1527.
    The paper discusses Husserl’s notion of definiteness as presented in his Göttingen Mathematical Society Double Lecture of 1901 as a defense of two, in many cases incompatible, ideals, namely full characterizability of the domain, i.e., categoricity, and its syntactic completeness. These two ideals are manifest already in Husserl’s discussion of pure logic in the Prolegomena: The full characterizability is related to Husserl’s attempt to capture the interconnection of things, whereas syntactic completeness relates to the interconnection of truths. In (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   9 citations  
  35.  63
    Complete and Partial Organizing for Corporate Social Responsibility.Andreas Rasche, Frank G. A. de Bakker & Jeremy Moon - 2013 - Journal of Business Ethics 115 (4):651-663.
    This paper investigates different modes of organizing for corporate social responsibility (CSR). Based on insights from organization theory, we theorize two ways to organize for CSR. “Complete” organization for CSR happens within businesses and depends on the availability of certain organizational elements (e.g., membership, hierarchy, rules, monitoring, and sanctioning). By contrast, “partial” organization for CSR happens when organizers do not have direct access to all these organizational elements. We discuss partial organization for CSR by analyzing how standards and cross-sector partnerships (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   13 citations  
  36. Completeness and Correspondence in Chellas–Segerberg Semantics.Matthias Unterhuber & Gerhard Schurz - 2014 - Studia Logica 102 (4):891-911.
    We investigate a lattice of conditional logics described by a Kripke type semantics, which was suggested by Chellas and Segerberg – Chellas–Segerberg (CS) semantics – plus 30 further principles. We (i) present a non-trivial frame-based completeness result, (ii) a translation procedure which gives one corresponding trivial frame conditions for arbitrary formula schemata, and (iii) non-trivial frame conditions in CS semantics which correspond to the 30 principles.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  37.  54
    Completeness of weak implication.Alasdair I. F. Urquhart - 1971 - Theoria 37 (3):274-282.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   10 citations  
  38. Epistemic completeness of GLA.E. Nogina - 2007 - Bulletin of Symbolic Logic 13 (3):407.
  39.  1
    Complete sets of logical functions.William Wernick - 1942 - [New York,: New york.
  40.  41
    The completeness of $S1$ and some related systems.Max J. Cresswell - 1972 - Notre Dame Journal of Formal Logic 13 (4):485-496.
  41. Canonical Extensions and Relational Completeness of Some Substructural Logics.J. Michael Dunn, Mai Gehrke & Alessandra Palmigiano - 2005 - Journal of Symbolic Logic 70 (3):713 - 740.
    In this paper we introduce canonical extensions of partially ordered sets and monotone maps and a corresponding discrete duality. We then use these to give a uniform treatment of completeness of relational semantics for various substructural logics with implication as the residual(s) of fusion.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   22 citations  
  42.  65
    Crawley Completions of Residuated Lattices and Algebraic Completeness of Substructural Predicate Logics.Hiroakira Ono - 2012 - Studia Logica 100 (1-2):339-359.
    This paper discusses Crawley completions of residuated lattices. While MacNeille completions have been studied recently in relation to logic, Crawley completions (i.e. complete ideal completions), which are another kind of regular completions, have not been discussed much in this relation while many important algebraic works on Crawley completions had been done until the end of the 70’s. In this paper, basic algebraic properties of ideal completions and Crawley completions of residuated lattices are studied first in their conncetion with the join (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  43.  57
    Was Carnap a Complete Verificationist in the Aufbau?Richard Creath - 1982 - PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association 1982:384 - 393.
    It is argued that Carnap was not a complete verificationist in the Aufbau despite the widespread view that he was. That doctrine would be intrinsic to constructionalism only if either of two additional assumptions are made, and there is no reason to believe that Carnap made these assumptions. Further, in the Aufbau Carnap did not demand verifiability independently of constructionalism, and his clear rejection of verifiability in Pseudoproblems counts heavily against his ever having accepted it in the Aufbau.
    Direct download  
     
    Export citation  
     
    Bookmark   9 citations  
  44. Complete Artworks without Authors.Kelly Trogdon - 2023 - Canadian Journal of Philosophy 53 (7-8):666-677.
    Investigation of a puzzle concerning complete yet authorless artworks.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  45. Complete Life in the Eudemian Ethics.Hilde Vinje - 2023 - Apeiron: A Journal for Ancient Philosophy and Science 53 (2):299–323.
    In the Eudemian Ethics II 1, 1219a34–b8, Aristotle defines happiness as ‘the activity of a complete life in accordance with complete virtue’. Most scholars interpret a complete life as a whole lifetime, which means that happiness involves virtuous activity over an entire life. This article argues against this common reading by using Aristotle’s notion of ‘activity’ (energeia) as a touchstone. It argues that happiness, according to the Eudemian Ethics, must be a complete activity that reaches its end at any and (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  46.  22
    Topological Completeness of First-Order Modal Logics.Steve Awodey & Kohei Kishida - 1998 - In Marcus Kracht, Maarten de Rijke, Heinrich Wansing & Michael Zakharyaschev, Advances in Modal Logic. CSLI Publications. pp. 1-17.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark  
  47. Model completeness of the new strongly minimal sets.Kitty Holland - 1999 - Journal of Symbolic Logic 64 (3):946-962.
  48. Are More Details Better? On the Norms of Completeness for Mechanistic Explanations.Carl F. Craver & David M. Kaplan - 2020 - British Journal for the Philosophy of Science 71 (1):287-319.
    Completeness is an important but misunderstood norm of explanation. It has recently been argued that mechanistic accounts of scientific explanation are committed to the thesis that models are complete only if they describe everything about a mechanism and, as a corollary, that incomplete models are always improved by adding more details. If so, mechanistic accounts are at odds with the obvious and important role of abstraction in scientific modelling. We respond to this characterization of the mechanist’s views about abstraction (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   65 citations  
  49.  97
    (1 other version)Elementary completeness properties of intuitionistic logic with a note on negations of prenex formulae.G. Kreisel - 1958 - Journal of Symbolic Logic 23 (3):317-330.
  50.  5
    Opere complete: con il testo greco.Francesco Adorno (ed.) - 2008 - Roma: Editori Laterza.
    Direct download  
     
    Export citation  
     
    Bookmark  
1 — 50 / 952