Normalisation of the Theory T of Cartesian Closed Categories and Conservativity of Extensions T [ x ] of T
Using an inductive definition of normal terms of the theory of Cartesian Closed Categories with a given graph of distinguished morphisms, we give a reduction free proof of the decidability of this theory. This inductive definition enables us to show via functional completeness that extensions of suc...
Saved in:
Published in | RAIRO. Informatique théorique et applications Vol. 33; no. 3; pp. 227 - 257 |
---|---|
Main Authors | , |
Format | Journal Article |
Language | English |
Published |
Paris
EDP Sciences
01.05.1999
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Abstract | Using an inductive definition of normal terms of the theory of Cartesian Closed Categories with a given graph of distinguished morphisms, we give a reduction free proof of the decidability of this theory. This inductive definition enables us to show via functional completeness that extensions of such a theory by new constants (“indeterminates”) are conservative. |
---|---|
AbstractList | Using an inductive definition of normal terms of the theory of Cartesian Closed Categories with a given graph of distinguished morphisms, we give a reduction free proof of the decidability of this theory. This inductive definition enables us to show via functional completeness that extensions of such a theory by new constants (“indeterminates”) are conservative. |
Author | Duroux, P. Preller, Anne |
Author_xml | – sequence: 1 givenname: Anne surname: Preller fullname: Preller, Anne – sequence: 2 givenname: P. surname: Duroux fullname: Duroux, P. |
BackLink | http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=1979413$$DView record in Pascal Francis https://hal.science/hal-05125536$$DView record in HAL |
BookMark | eNpFkF9LwzAUxYNMcE6f_AJ58EWkmrRN2vg2ynTC0JcKgkjJ8sdldMlIwti-vSkbel8u9_A7B-65BCPrrALgBqMHjAh-NJE_YcYYxuQMjHHOUFbU5HMExojVdVZUpLwAlyGsEUI4zRis35zf8N4EHo2z0GkYVwq2K-X8AbbD3XAfVTDcwqZ3QckkRPXjvFEBcptOZ4Pyu-TfmXgYHLN9VDakuJASvuAefg9qewXONe-Duj7tCfh4nrXNPFu8v7w200UmcpLHjHKkK4okExQTrGuZ53SpK0kJFULK9FpZVkJrjSskNSaqqBVdYqYqRISWqJiAu2Puivfd1psN94fOcdPNp4tu0FJTOSEF3eHE3h7ZLQ-C99pzK0z4c2FWsRIXCbs_YsK7ELzS_wTqhua71Hx3ar74BUy8d8I |
CODEN | RITAE4 |
Cites_doi | 10.1007/3-540-60164-3_27 10.1016/0890-5401(87)90018-6 10.1007/978-1-4612-2572-0_6 10.1109/LICS.1991.151645 |
ContentType | Journal Article |
Copyright | 1999 INIST-CNRS Distributed under a Creative Commons Attribution 4.0 International License |
Copyright_xml | – notice: 1999 INIST-CNRS – notice: Distributed under a Creative Commons Attribution 4.0 International License |
DBID | AAYXX CITATION IQODW 1XC |
DOI | 10.1051/ita:1999115 |
DatabaseName | CrossRef Pascal-Francis Hyper Article en Ligne (HAL) |
DatabaseTitle | CrossRef |
DatabaseTitleList | |
DeliveryMethod | fulltext_linktorsrc |
Discipline | Mathematics Computer Science |
EISSN | 1290-385X |
EndPage | 257 |
ExternalDocumentID | oai_HAL_hal_05125536v1 1979413 10_1051_ita_1999115 |
GroupedDBID | --K -E. -~X .DC .FH 0E1 123 1B1 4.4 5VS 74X 74Y 7~V 8FE 8FG AADXX AAFNC AAOGA AAOTM AAYXX ABGDZ ABKKG ABNSH ABUBZ ABZDU ACACO ACGFS ACIMK ACIWK ACQPF ACRPL ACZPN ADNMO AEMTW AFAYI AFHSK AFUTZ AGQPQ AJPFC ALMA_UNASSIGNED_HOLDINGS ARABE AZPVJ BPHCQ C0O CITATION CS3 DC4 EBS EJD FAM HG- HST HZ~ I.6 IHE IL9 I~P J36 J38 J3A K6V L6V L98 LO0 M-V M41 NQ- O9- OAV P62 PQQKQ PROAC RCA ROL RPZ RR0 S6- VH1 WQ3 WXU IQODW 1XC |
ID | FETCH-LOGICAL-c252t-6a0f760d9c6151f8d226bf7d656ccdd115447cfff170df15e38e6b19e705cfd03 |
ISSN | 0988-3754 |
IngestDate | Thu Jun 26 06:33:47 EDT 2025 Mon Jul 21 09:11:15 EDT 2025 Tue Jul 01 01:16:03 EDT 2025 |
IsPeerReviewed | true |
IsScholarly | true |
Issue | 3 |
Keywords | Slide rule Chemical reduction Rewrite system Evaluation Decidability Completeness Category theory Normal form Automatic proving Church Roser system Evaluation rule Complexity cc:18D15 cc:03F05 cc:03B25 |
Language | English |
License | CC BY 4.0 Distributed under a Creative Commons Attribution 4.0 International License: http://creativecommons.org/licenses/by/4.0 |
LinkModel | OpenURL |
MergedId | FETCHMERGED-LOGICAL-c252t-6a0f760d9c6151f8d226bf7d656ccdd115447cfff170df15e38e6b19e705cfd03 |
PageCount | 31 |
ParticipantIDs | hal_primary_oai_HAL_hal_05125536v1 pascalfrancis_primary_1979413 crossref_primary_10_1051_ita_1999115 |
ProviderPackageCode | CITATION AAYXX |
PublicationCentury | 1900 |
PublicationDate | 1999-05-01 |
PublicationDateYYYYMMDD | 1999-05-01 |
PublicationDate_xml | – month: 05 year: 1999 text: 1999-05-01 day: 01 |
PublicationDecade | 1990 |
PublicationPlace | Paris |
PublicationPlace_xml | – name: Paris |
PublicationTitle | RAIRO. Informatique théorique et applications |
PublicationYear | 1999 |
Publisher | EDP Sciences |
Publisher_xml | – name: EDP Sciences |
References | R2 R3 R5 R6 R7 Obtu (R8) 1987; 73 R1 Cubric (R4) 1998; 8 |
References_xml | – ident: R7 – ident: R1 doi: 10.1007/3-540-60164-3_27 – volume: 8 start-page: 153 year: 1998 ident: R4 publication-title: MSCS – volume: 73 start-page: 129 year: 1987 ident: R8 publication-title: Inform. and Comput. doi: 10.1016/0890-5401(87)90018-6 – ident: R3 – ident: R5 doi: 10.1007/978-1-4612-2572-0_6 – ident: R6 – ident: R2 doi: 10.1109/LICS.1991.151645 |
SSID | ssj0001111 |
Score | 1.4618831 |
Snippet | Using an inductive definition of normal terms of the theory of Cartesian Closed Categories with a given graph of distinguished morphisms, we give a reduction... |
SourceID | hal pascalfrancis crossref |
SourceType | Open Access Repository Index Database |
StartPage | 227 |
SubjectTerms | Algebra Category theory, homological algebra Computer Science Exact sciences and technology General logic Logic and foundations Logic in Computer Science Mathematical logic, foundations, set theory Mathematics Proof theory and constructive mathematics Sciences and techniques of general use |
Title | Normalisation of the Theory T of Cartesian Closed Categories and Conservativity of Extensions T [ x ] of T |
URI | https://hal.science/hal-05125536 |
Volume | 33 |
hasFullText | 1 |
inHoldings | 1 |
isFullTextHit | |
isPrint | |
link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3db9MwELfKeAEhPgaIAkMW2p6qjHw5WXgLbacOtm4aGao0ochJbG3T1ExtOlX8N_yn3MXOl9jD4MVq48ZJfT-fz_bd7wjZhhkyBTPcMVxbcsPNYMwlbmIaPLEEAIb7NscT3aOpNzlzv87YrNf73fJaWhXJbvrrzriS_5EqXAO5YpTsP0i2bhQuwGeQL5QgYSjvJeMpGpzX2iGnOu1X0faDSEVeLcCUxDE8vM6XuJmLxBA5Lo_LUwNM16l2ZW-1a8Z4Xbq0owNNNNhhXwZrKEdYE7Xt2NPw4PR4d6CDmYqSBBYevjMcgmkK7ZeksCVjeXdTEJXwQlThh-G8OdQfrRb5aq2MWswaIJr9CMVhwNr7EePRSaWWOruNIDrMtqumHaVr7QCpfdmsrYwVK4YGndPWrIpCQE_StmK1_kv_g4oBoV0WmNcIX85SsaJdnu1J-D0-Ge3HhwfTb93amnB7Eh7GF4AHaA_WXI53CwvshzasRDBJxnH4o57sccYp6Rz1_9MhoHDfJ3iLz_odOkbPgwt0uX1yw5cwCqVKn9KyaaLn5KlejNBQIesF6Yn5JnlWJfqguoM3yeOjmtx3-ZJcdWBHc0mhkirY0Qi_17CjCna0gR0F2NEu7PCOBnbQwjld0594NXpFzvbH0XBi6JQdRmozuzA8bkrfM7MgRUtZ7mVg3SfSz2DVkKZZVnI_-amU0vLNTFpMOHvCS6xA-CZLZWY6r8nGPJ-LN4Q6Zsr8wJRgMXPXyzzO7cThwvIS0CMp432yXfVpfKOYWeLSo4JZMXR9rLu-Tz6iIKtf3C3cPtnqiKNpMID5ynLe3qeRd-RRMx7ek41isRJbYLEWyYcSM38ARNqX0g |
linkProvider | Cellule MathDoc |
openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Normalisation+of+the+Theory+T+of+Cartesian+Closed+Categories+and+Conservativity+of+Extensions+T+%5B+x+%5D+of+T&rft.jtitle=RAIRO.+Informatique+the%CC%81orique+et+applications&rft.au=Preller%2C+Anne&rft.au=Duroux%2C+Patrice&rft.date=1999-05-01&rft.pub=EDP+Sciences&rft.issn=0988-3754&rft.eissn=1290-385X&rft.volume=33&rft.issue=3&rft.spage=227&rft.epage=257&rft_id=info:doi/10.1051%2Fita%3A1999115&rft.externalDBID=HAS_PDF_LINK&rft.externalDocID=oai_HAL_hal_05125536v1 |
thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0988-3754&client=summon |
thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0988-3754&client=summon |
thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0988-3754&client=summon |