Filters








1,625,818 Hits in 4.5 sec

On the meaning of logical completeness

Michele Basaldella, Kazushige Terui, Pierre-Louis Curien
<span title="2010-12-22">2010</span> <i title="Logical Methods in Computer Science e.V."> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/c67srop7pbe3nciquoxzy3d6pm" style="color: black;">Logical Methods in Computer Science</a> </i> &nbsp;
Following a previous work [3], we consider an extension of the original ludics with contraction and universal nondeterminism, which play dual roles, in order to capture a polarized fragment of linear logic  ...  and thus a constructive variant of classical propositional logic.  ...  Acknowledgement We are deeply indebted to Pierre-Louis Curien, who gave us a lot of useful comments. Our thanks are also due to the anonymous referees.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.2168/lmcs-6(4:11)2010">doi:10.2168/lmcs-6(4:11)2010</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/hoy3cxrdtnaylnew6zr562bghu">fatcat:hoy3cxrdtnaylnew6zr562bghu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180720193611/https://lmcs.episciences.org/1066/pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/87/b8/87b864338b4963f3bda9b6de76c78c38a5232831.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.2168/lmcs-6(4:11)2010"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> Publisher / doi.org </button> </a>

On the Meaning of Logical Completeness [chapter]

Michele Basaldella, Kazushige Terui
<span title="">2009</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
Following a previous work [3], we consider an extension of the original ludics with contraction and universal nondeterminism, which play dual roles, in order to capture a polarized fragment of linear logic  ...  and thus a constructive variant of classical propositional logic.  ...  Acknowledgement We are deeply indebted to Pierre-Louis Curien, who gave us a lot of useful comments. Our thanks are also due to the anonymous referees.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-02273-9_6">doi:10.1007/978-3-642-02273-9_6</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/6k4dx42s6rexhj5v5gsstxlslu">fatcat:6k4dx42s6rexhj5v5gsstxlslu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180720193611/https://lmcs.episciences.org/1066/pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/87/b8/87b864338b4963f3bda9b6de76c78c38a5232831.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-02273-9_6"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Comparison of first order predicate logic, fuzzy logic and non-monotonic logic as knowledge representation methodology

Kyung Hoon Yang, David Olson, Jaekyung Kim
<span title="">2004</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/ekjwtd7zwfeipf5aknu4733lzy" style="color: black;">Expert systems with applications</a> </i> &nbsp;
We then prove that the complexities of the three methods are NP-complete. We use this information to design a heuristic algorithm tested on probabilistic input to evaluate accuracy and completeness.  ...  We also evaluate first order predicate logic, fuzzy logic and non-monotonic logic for the above properties, in the view of accuracy, complexity, and completeness.  ...  It means the range of truth is flexible in nonmonotonic logic. Based on the above assumptions, we develop the heuristic algorithm.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.eswa.2004.05.012">doi:10.1016/j.eswa.2004.05.012</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/nmiofgzni5aazgqqyzthrx6idy">fatcat:nmiofgzni5aazgqqyzthrx6idy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20120117145958/http://www.is.uwlax.edu/Yang/research/fuzzy%20logic.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/fc/56/fc56c5e16e6e5fcd9ccd2a2547c37a0bda343871.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.eswa.2004.05.012"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Should pluralists be pluralists about pluralism?

Robert Passmann
<span title="2021-08-10">2021</span> <i title="Springer Science and Business Media LLC"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/munzfrczajgrfktmdt7fobcory" style="color: black;">Synthese</a> </i> &nbsp;
I will argue that these depend on an implicitly assumed absoluteness of correct logic.  ...  That is the meta-logic. It turns out that there are some meta-logical challenges specifically for the pluralists.  ...  I thank Leon Commandeur for his very helpful comments on several drafts of this paper.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s11229-021-03348-5">doi:10.1007/s11229-021-03348-5</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ekupqw3ciffgtmrece6m7whzqe">fatcat:ekupqw3ciffgtmrece6m7whzqe</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20210812081731/http://link.springer.com/content/pdf/10.1007/s11229-021-03348-5.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/b4/70/b470f297652f3d0d6e8e80fc426843c1dfd46c7d.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s11229-021-03348-5"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> springer.com </button> </a>

Logic: A Brief Course by Daniele Mundici, Springer, 2012. Paperback, ISBN 978-88-470-2360-4, xi + 124 pp

Krzysztof R. Apt
<span title="">2012</span> <i title="Cambridge University Press (CUP)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/yhwvj6mbzza5tfz766tokherka" style="color: black;">Theory and Practice of Logic Programming</a> </i> &nbsp;
The chapter ends with the presentation of the Gödel's Completeness Theorem for the predicate logic with equality, where provability means refutability by means of the Davis-Putnam procedure applied to  ...  This makes it possible to completely drop the proof theory and focus instead on the procedural way of drawing conclusions by means of refutations.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1017/s1471068412000026">doi:10.1017/s1471068412000026</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/5fr3xs7zqzaofmpjieueiwvvya">fatcat:5fr3xs7zqzaofmpjieueiwvvya</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170829192921/http://static.springer.com/sgw/documents/1337412/application/pdf/9788847023604-r2.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/0a/3f/0a3fb0bd5544098ef2d21af1c4e5b763a3f1e416.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1017/s1471068412000026"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> cambridge.org </button> </a>

On Four Types of Argumentation For Classical Logic

Bożena Czernecka-Rej
<span title="2021-01-04">2021</span> <i title="Towarzystwo Naukowe KUL"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/v7ic63axnjcfli2zf3qwvzxghe" style="color: black;">Roczniki Filozoficzne</a> </i> &nbsp;
The holistic concept of the meaning of logical constants goes together with the thesis on difference of meanings.  ...  The completeness theorem, on the other hand, is not valid for second-order calculus 15 or for modal logics. 16 The property of completeness of logic is important because in a complete system it is possible  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.18290/rf20684-13">doi:10.18290/rf20684-13</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/nuavl27zfvazrbctjz5q7lyepm">fatcat:nuavl27zfvazrbctjz5q7lyepm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20210112014253/https://ojs.tnkul.pl/index.php/rf/article/download/14907/14357" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/3d/7a/3d7a8ae95f85057829c0c57c7fd511b49b9807f6.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.18290/rf20684-13"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> Publisher / doi.org </button> </a>

A note on the Declarative reading(s) of Logic Programming [article]

Marc Denecker
<span title="2000-03-13">2000</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
One common view is that logic programming is a logic for default reasoning, a sub-formalism of default logic or autoepistemic logic. In this view, negation as failure is a modal operator.  ...  This paper analyses the declarative readings of logic programming. Logic programming - and negation as failure - has no unique declarative reading.  ...  The ability of interpreting the formulas of a logic as meaningful statements about the problem domain -given some interpretation of the user-defined symbols-is the declarative reading of the logic.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/cs/0003056v1">arXiv:cs/0003056v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/r3ihirojojfcvpfsibut2n3brm">fatcat:r3ihirojojfcvpfsibut2n3brm</a> </span>
<a target="_blank" rel="noopener" href="https://archive.org/download/arxiv-cs0003056/cs0003056.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> File Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/b5/a7/b5a7f9957c4a15497535729bc698bd405ab5a579.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/cs/0003056v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Development and Application of Logical Actors Mathematical Apparatus for Logic Programming of Web Agents [chapter]

Alexei A. Morozov
<span title="">2003</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
One of the most interesting and promising approaches to programming Internet agents is logic programming of agents.  ...  Many ideas and methods of logic programming of Internet agents based on various modifications of Prolog and non-classical logic (linear, modal, etc.) were developed during the recent decade.  ...  The completeness of logic programs means that the programming language guarantees that a program will found all solutions of a problem.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-540-24599-5_39">doi:10.1007/978-3-540-24599-5_39</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/iddvh4wt25cqdhmkueh6bcy5ey">fatcat:iddvh4wt25cqdhmkueh6bcy5ey</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20060822144041/http://www.cplire.ru:80/Lab144/iclp03.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/20/51/2051dcc58d1abeee409f9b7d608e4e1f2e93cf7f.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-540-24599-5_39"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

A mind of a non-countable set of ideas

Alexander Citkin
<span title="2008-06-19">2008</span> <i title="Uniwersytet Mikolaja Kopernika/Nicolaus Copernicus University"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/cqchsjbcrzesbc3b7elv2aorpy" style="color: black;">Logic and Logical Philosophy</a> </i> &nbsp;
He was very broad-minded and conducted research in many areas of non-classical logics. Always in a main stream of research, he very often defined what the main stream was.  ...  This article is dedicated to Alexander Vladimirovich Kuznetsov, the scientist who has, perhaps, accomplished more than anyone else in the studies of non-classical propositional logics.  ...  Philosophical Encyclopedia, one of the most authoritative sources on philosophy and logic in Russia in the 1950s, defines Logic as a science about acceptable means of reasoning.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.12775/llp.2008.003">doi:10.12775/llp.2008.003</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/f5jfom4enbcx7dihwlgp75ygue">fatcat:f5jfom4enbcx7dihwlgp75ygue</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170707010707/http://apcz.umk.pl/czasopisma/index.php/LLP/article/download/LLP.2008.003/1299/" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/e5/a8/e5a8b0814a6b598b1b5272d22b3c3f1b7f8b8273.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.12775/llp.2008.003"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> Publisher / doi.org </button> </a>

On Axiom Systems of Słupecki for the Functionally Complete Three-Valued Logic

Mateusz M. Radzki
<span title="2016-11-07">2016</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/l4xjq5zi6jfsnhdqlsi7lzgddy" style="color: black;">Axiomathes</a> </i> &nbsp;
The article concerns two axiom systems of Słupecki for the functionally complete three-valued propositional logic: W1-W6 (from 1936) and A1-A9 (from 1946).  ...  axiom system for the functionally complete three-valued logic.  ...  Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s10516-016-9319-x">doi:10.1007/s10516-016-9319-x</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/znbhkxfi7jhcfgeb2w7ifwnbbq">fatcat:znbhkxfi7jhcfgeb2w7ifwnbbq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20171012064207/http://publisher-connector.core.ac.uk/resourcesync/data/Springer-OA/pdf/4a3/aHR0cDovL2xpbmsuc3ByaW5nZXIuY29tLzEwLjEwMDcvczEwNTE2LTAxNi05MzE5LXgucGRm.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/c6/dc/c6dc633d4a83caaac744d7da5e6987462ac2b7ca.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s10516-016-9319-x"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Tree Trimming: Four Non-Branching Rules for Priest's Introduction to Non-Classical Logic

Marilynn Johnson
<span title="2017-12-01">2017</span> <i title="Victoria University of Wellington Library"> The Australasian Journal of Logic </i> &nbsp;
In each of these logics the proposed rule leads to tableaux with fewer branches.  ...  In Intuitionist logic, the proposed rules allow for the resolution of a particular problem Priest grapples with throughout the chapter.  ...  A version of this paper was presented at the Saul Kripke Center at the City University of New York in December 2013.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.26686/ajl.v12i2.2066">doi:10.26686/ajl.v12i2.2066</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ccbtadoj6fbpnmcpverupjnfam">fatcat:ccbtadoj6fbpnmcpverupjnfam</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190429134923/https://ojs.victoria.ac.nz/ajl/article/download/2066/2065" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/b5/b3/b5b3e5e850a45415544c894ea9de08c03c45be3e.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.26686/ajl.v12i2.2066"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Page 27 of Mathematical Reviews Vol. , Issue 2002A [page]

<span title="">2002</span> <i title="American Mathematical Society"> <a target="_blank" rel="noopener" href="https://archive.org/details/pub_mathematical-reviews" style="color: black;">Mathematical Reviews </a> </i> &nbsp;
Logic Lang. Inform. 10 (2001), no. 1, 63-86 The meaning of a discourse @ can be considered as a “composition” of the meanings of the sentences that form the discourse.  ...  As our minds process sentences in the order in which they occur, one could hope for a binary function / such that the meaning [ Such a binary function would give the meaning of any discourse of any length  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_2002-01_2002a/page/27" title="read fulltext microfilm" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Archive [Microfilm] <div class="menu fulltext-thumbnail"> <img src="https://archive.org/serve/sim_mathematical-reviews_2002-01_2002a/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

Local Completeness Logic on Kleene Algebra with Tests [article]

Marco Milanese, Francesco Ranzato
<span title="2022-05-17">2022</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
Local Completeness Logic (LCL) has been put forward as a program logic for proving both the correctness and incorrectness of program specifications.  ...  logically sound and, under some hypotheses, complete.  ...  Local completeness logic LCL relies on an abstract interpretation of programs which crucially depends on intensional properties of programs, meaning that even if two programs share the same denotation,  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2205.08128v1">arXiv:2205.08128v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/fdff66gchng2ph26b6dxvaf35e">fatcat:fdff66gchng2ph26b6dxvaf35e</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20220524200753/https://arxiv.org/pdf/2205.08128v1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/82/42/8242f1b5cd2307fb755d4f54e72539d310253ed1.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2205.08128v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Kant on Complete Determination and Infinite Judgement

Nicholas F. Stang
<span title="">2012</span> <i title="Informa UK Limited"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/aeucewt45bhm7lsmv74ztb3xsi" style="color: black;">British Journal for the History of Philosophy</a> </i> &nbsp;
Although I think this way of drawing the distinctions best captures Kant's underlying picture, it is not how he usually presents his view, so I will not present it that way in the body of the paper.  ...  I don't think this substantially affects Kant's logical theory, or my argument, but I think it is worth pointing out. The closest he comes to acknowledging this is in the Wiener Logik (24:930).  ...  already seen what Kant means by claiming that the principle of complete determination "deals with the content and not merely the logical form": it is a principle of transcendental logic, for it requires  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1080/09608788.2012.731242">doi:10.1080/09608788.2012.731242</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/tw67nhqncvgllk7ls4ifdtojou">fatcat:tw67nhqncvgllk7ls4ifdtojou</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170814100203/https://philpapers.org/archive/STAIAT-2.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/29/f8/29f87d52d1791dfda5b7893a102d6314e46a4c51.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1080/09608788.2012.731242"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> tandfonline.com </button> </a>

Congestion Control in Asynchronous Transfer Mode (ATM) Network

Onyejegbu Laeticia, Okafor Nkiru
<span title="2016-05-17">2016</span> <i title="Foundation of Computer Science"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/b637noqf3vhmhjevdfk3h5pdsu" style="color: black;">International Journal of Computer Applications</a> </i> &nbsp;
It was observed that the call completion success rate enabled users to make calls without distortion of network. Comparison was made between fuzzy logic and call completion success rate.  ...  It was observed that, congestion load environment 4 has a value for mean bit rate as 1.4, mean burst as 1.4, state of network as 0.94 and retainability 0.9222 the last two are positive.  ...  effect of variations of call retainability on congestion control in 1oad environments 4 has the value of mean bit rate (1.4), mean burst (1  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.5120/ijca2016909736">doi:10.5120/ijca2016909736</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/yvje33dminetzjx7ik2e3b7saa">fatcat:yvje33dminetzjx7ik2e3b7saa</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180601235353/https://www.ijcaonline.org/archives/volume142/number4/nneka-2016-ijca-909736.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/f8/f0/f8f032c0ba60f21f12e9c1e0ca3b604789b33318.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.5120/ijca2016909736"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 1,625,818 results