Filters








361 Hits in 2.3 sec

Page 3681 of Mathematical Reviews Vol. , Issue 82i [page]

<span title="">1982</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;
-(Q..) consists of rules that establish the intuitionistic calculus of formal metalogic.  ...  Mittelstaedt and co-workers to a propositional calculus of modal quantum metalogic [see Mittelstaedt, Quantum logic, Reidel, Dordrecht, 1978; MR 82g:03109]. Following E.-W. Stachow [J. Philos.  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_1982-09_82i/page/3681" 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_1982-09_82i/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

Metalogical properties, being logical and being formal

Jan Woleński
<span title="2004-01-19">2004</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;
Propositional calculus is a logical theory (belongs to logic), but the theory of evolution is not.  ...  We can apply it to concepts, propositions, sets of propositions (systems, theories) and methods. The concepts of quantifier or disjunction are logical but those of horse or water are not.  ...  Decidability and Post-completeness, as metalogical properties, decide that semantics of propositional calculus is fully constructive and can be replaced without any remainder by the syntax of this system  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.12775/llp.2002.013">doi:10.12775/llp.2002.013</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/txdkypla3fem7b2msa347ajppu">fatcat:txdkypla3fem7b2msa347ajppu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170922012430/http://apcz.umk.pl/czasopisma/index.php/LLP/article/download/LLP.2002.013/2719" 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/bf/cd/bfcd20d54eef201dd04071c3a3eeb49ee90a3899.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.12775/llp.2002.013"> <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 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;
If we assume that decidability is a decisive property, then only the propositional calculus (and, possibly, a certain fragment of predicate calculus) will remain logic.  ...  The degree of logicality, measured by the syntactic expressibility of semantic properties, is the largest in propositional logic, smaller in predicate calculus, and still smaller in predicate calculus  ... 
<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>

Page 4440 of Mathematical Reviews Vol. , Issue 95h [page]

<span title="">1995</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;
He begins with a variant of the nonassociative Lambek calculus and, with the addition of more and more structural rules, proceeds up through BCK logic and intuitionistic logic.  ...  The system M corresponds to the intuitionistic propositional logic of conjunction and implication; the author extends the system until it comprises all of intuitionistic predicate logic.  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_1995-08_95h/page/4440" 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_1995-08_95h/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

Modal logic as metalogic

Kosta Došen
<span title="">1992</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/dhs2rsfonnhrbntyqjovx333um" style="color: black;">Journal of Logic, Language and Information</a> </i> &nbsp;
First a family of propositional logical systems is considered, which is obtained by gradually adding structural rules to a variant of the nonassociative Lambek calculus.  ...  In this family one finds systems that correspond to the associative Lambek calculus, linear logic, relevant logics, BCK logic and intuitionistic logic.  ...  I would also like to thank for their hospitality the Centre for Philosophy and Theory of Science of the University of Constance, the SNS  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/bf00156914">doi:10.1007/bf00156914</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/tezzrfrc3jdetolwcgukrs26y4">fatcat:tezzrfrc3jdetolwcgukrs26y4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20160122194644/http://www.mi.sanu.ac.rs:80/~kosta/Dosen%20radovi/[P][33]%20Modal%20logic%20as%20metalogic.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/ac/0d/ac0dd56f7c4271b24535875ca9e07c69c8b8e100.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/bf00156914"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Page 8172 of Mathematical Reviews Vol. , Issue 99m [page]

<span title="">1999</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 for first- order propositional and predicate calculus.  ...  Also, by proving a theorem which states that provability in a flattened sequent calculus implies provability in the standard sequent calculus, we show how some metalogical provability results about the  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_1999-12_99m/page/8172" 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_1999-12_99m/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

Page 890 of Mathematical Reviews Vol. , Issue 2000b [page]

<span title="">2000</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;
can be expressed using the propositional connectives of this calculus.  ...  Summary: “We show that the axioms of paraconsistent intentional logic, the Kolmogorov axioms, and the Lukasiewicz-Tarski axioms can be proved as theorems of an intuitionistic fuzzy logic.” 2000b:03088  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_2000-02_2000b/page/890" 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_2000-02_2000b/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

Page 4036 of Mathematical Reviews Vol. 58, Issue 6 [page]

<span title="">1979</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;
Such systems correspond to the calculus of propositions of assertoric logic.  ...  M. 58 #27354 An intuitionistically plausible interpretation of intuitionistic logic. J. Symbolic Logic 42 (1977), no. 4, 564-578.  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_1979-12_58_6/page/4036" 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_1979-12_58_6/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

Page 1176 of Mathematical Reviews Vol. 44, Issue 6 [page]

<span title="">1972</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;
Let I’, A, --- be elements of a | Under the intuitionistic propositional calculus; (2) R is Kripke model and let [A stand for Il satisfies A; then | decidable; (3) every Ac R is regularly realizable (there  ...  McCullough, Dean P. 6447 | The author studies the class of all realizable propositional Logical connectives for intuitionistic propositional logic. | formulas (p.f.) [S. C.  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_1972-12_44_6/page/1176" 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_1972-12_44_6/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

Foundations for the formalization of metamathematics and axiomatizations of consequence theories

Urszula Wybraniec-Skardowska
<span title="">2004</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/bnojym2hjzcgnpa4wixi2axhnq" style="color: black;">Annals of Pure and Applied Logic</a> </i> &nbsp;
Andrzej Grzegorczyk's signiÿcant results which laid the foundations for the formalization of metalogic, are touched upon brie y.  ...  This paper deals with Tarski's ÿrst axiomatic presentations of the syntax of deductive system.  ...  deductive systems based on the Intuitionistic, minimal, positive propositional calculus Characterization of the intuitionistic, minimal, positive propositional calculus C ⇒ ; ∼ ; ∧ ; ∨ C I C M C P PT  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.apal.2003.11.018">doi:10.1016/j.apal.2003.11.018</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/y7rcxbnvrne6noplrndfpfkxdu">fatcat:y7rcxbnvrne6noplrndfpfkxdu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190303000617/https://core.ac.uk/download/pdf/82160669.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/24/94/24947e17e8f04330bd0f471cb1181ed074ae2fb5.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.apal.2003.11.018"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Page 18 of Mathematical Reviews Vol. , Issue 96a [page]

<span title="">1996</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;
The metalogic obtained behaves as a sequent calculus system to deduce truth and falsity in interpretations.  ...  The fact that a judgment holds is derivable in the object logic, while the metalogic is turned into a sequent calculus system for the ob- ject logic.  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_1996-01_96a/page/18" 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_1996-01_96a/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

Page 6869 of Mathematical Reviews Vol. , Issue 90M [page]

<span title="">1990</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;
The calculus R of relevant logic is here given a homophone se- mantics, in which the metalogical interpretations of the logical constants, in particular negation and implication, are the same as those  ...  In view of the result proved in the first section of the paper stating that for any propositional modal formula A, A is provable in S5 if and only if OA is provable in K45, the author’s sequent calculus  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_1990-12_90m/page/6869" 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_1990-12_90m/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

Page 2813 of Mathematical Reviews Vol. , Issue 82g [page]

<span title="">1982</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;
In this sense, the calculus Q,,,, based on the dialogue-game D,, can be considered as an intuitionistic version of quantum propositional calculi [cf. Lorenzen, op. cit.].  ...  It is proved that < is an order relation, and based on this order a propositional calculus, called the calculus of effective quantum logic, and denoted by Q..,, is elaborated by means of eight axiom schemas  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_1982-07_82g/page/2813" 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_1982-07_82g/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

Page 1234 of Mathematical Reviews Vol. , Issue 81D [page]

<span title="">1981</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;
Ursini, Aldo 81d:03022 A modal calculus analogous to K4W, based on intuitionistic propositional logic. I. Studia Logica 38 (1979), no. 3, 297-311.  ...  The author deals with a modal system ID based on intuitionistic sentential calculus; [)p is thought of as meaning “ is provable”.  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_1981-04_81d/page/1234" 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_1981-04_81d/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

A General Theory of Completeness Proofs

Sh^|^ocirc;ji MAEHARA
<span title="">1970</span> <i title="The Japan Association for Philosophy of Science"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/k7izqsbokbe2dof3is2sa2wapy" style="color: black;">Annals of the Japan Association for Philosophy of Science</a> </i> &nbsp;
In this treatise, we comment on the classical and the intuitionistic logic only.  ...  The purpose of the following treatise is to remark the fact that the method developed in Schiitte [6] is able to give a unification to completeness proofs for several formal systems of logic.  ...  The calculus LK or LJ based on those formulas gives a system of the classical or intuitionistic propositional calculus, respectively.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4288/jafpos1956.3.242">doi:10.4288/jafpos1956.3.242</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/szgmwmcf5vhhjewqc3n6t6jare">fatcat:szgmwmcf5vhhjewqc3n6t6jare</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20181030134854/https://www.jstage.jst.go.jp/article/jafpos1956/3/5/3_5_242/_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/84/bd/84bdf6d94294c6ff34d4557db72cc457deef35c3.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4288/jafpos1956.3.242"> <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>
&laquo; Previous Showing results 1 &mdash; 15 out of 361 results