default search action
Search dblp for Publications
export results for "toc:db/journals/tcs/tcs232.bht:"
@article{DBLP:journals/tcs/AraiM00, author = {Toshiyasu Arai and Grigori Mints}, title = {Extended normal form theorems for logical proofs from axioms}, journal = {Theor. Comput. Sci.}, volume = {232}, number = {1-2}, pages = {121--132}, year = {2000}, url = {https://doi.org/10.1016/S0304-3975(99)00172-3}, doi = {10.1016/S0304-3975(99)00172-3}, timestamp = {Mon, 28 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/AraiM00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Bunder00, author = {Martin W. Bunder}, title = {Proof finding algorithms for implicational logics}, journal = {Theor. Comput. Sci.}, volume = {232}, number = {1-2}, pages = {165--186}, year = {2000}, url = {https://doi.org/10.1016/S0304-3975(99)00174-7}, doi = {10.1016/S0304-3975(99)00174-7}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Bunder00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/CaldwellGU00, author = {James L. Caldwell and Ian P. Gent and Judith L. Underwood}, title = {Search algorithms in type theory}, journal = {Theor. Comput. Sci.}, volume = {232}, number = {1-2}, pages = {55--90}, year = {2000}, url = {https://doi.org/10.1016/S0304-3975(99)00170-X}, doi = {10.1016/S0304-3975(99)00170-X}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/CaldwellGU00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/CervesatoHP00, author = {Iliano Cervesato and Joshua S. Hodas and Frank Pfenning}, title = {Efficient resource management for linear logic proof search}, journal = {Theor. Comput. Sci.}, volume = {232}, number = {1-2}, pages = {133--163}, year = {2000}, url = {https://doi.org/10.1016/S0304-3975(99)00173-5}, doi = {10.1016/S0304-3975(99)00173-5}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/CervesatoHP00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Felty00, author = {Amy P. Felty}, title = {The calculus of constructions as a framework for proof search with set variable instantiation}, journal = {Theor. Comput. Sci.}, volume = {232}, number = {1-2}, pages = {187--229}, year = {2000}, url = {https://doi.org/10.1016/S0304-3975(99)00175-9}, doi = {10.1016/S0304-3975(99)00175-9}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Felty00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Galmiche00, author = {Didier Galmiche}, title = {Connection methods in linear logic and proof nets construction}, journal = {Theor. Comput. Sci.}, volume = {232}, number = {1-2}, pages = {231--272}, year = {2000}, url = {https://doi.org/10.1016/S0304-3975(99)00176-0}, doi = {10.1016/S0304-3975(99)00176-0}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Galmiche00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/GalmicheP00, author = {Didier Galmiche and David J. Pym}, title = {Proof-search in type-theoretic languages: an introduction}, journal = {Theor. Comput. Sci.}, volume = {232}, number = {1-2}, pages = {5--53}, year = {2000}, url = {https://doi.org/10.1016/S0304-3975(99)00169-3}, doi = {10.1016/S0304-3975(99)00169-3}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/GalmicheP00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/McDowellM00, author = {Raymond McDowell and Dale Miller}, title = {Cut-elimination for a logic with definitions and induction}, journal = {Theor. Comput. Sci.}, volume = {232}, number = {1-2}, pages = {91--119}, year = {2000}, url = {https://doi.org/10.1016/S0304-3975(99)00171-1}, doi = {10.1016/S0304-3975(99)00171-1}, timestamp = {Sat, 09 Apr 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/McDowellM00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Nadathur00, author = {Gopalan Nadathur}, title = {Correspondences between classical, intuitionistic and uniform provability}, journal = {Theor. Comput. Sci.}, volume = {232}, number = {1-2}, pages = {273--298}, year = {2000}, url = {https://doi.org/10.1016/S0304-3975(99)00177-2}, doi = {10.1016/S0304-3975(99)00177-2}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Nadathur00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/RitterPW00, author = {Eike Ritter and David J. Pym and Lincoln A. Wallen}, title = {On the intuitionistic force of classical search}, journal = {Theor. Comput. Sci.}, volume = {232}, number = {1-2}, pages = {299--333}, year = {2000}, url = {https://doi.org/10.1016/S0304-3975(99)00178-4}, doi = {10.1016/S0304-3975(99)00178-4}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/RitterPW00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.