{"entities":{"Q7361431":{"pageid":31519832,"ns":120,"title":"Item:Q7361431","lastrevid":105365822,"modified":"2026-10-07T13:36:18Z","type":"item","id":"Q7361431","labels":{"en":{"language":"en","value":"Renaming-Enriched Sets (Rensets) and Renaming-Based Recursion"}},"descriptions":{"en":{"language":"en","value":"AFP entry Rensets"}},"aliases":{},"claims":{"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"15cc59932ca5eb0772f2317fd4f88f601371a077","datavalue":{"value":"https://isa-afp.org/entries/Rensets.html","type":"string"},"datatype":"url"},"type":"statement","id":"Q7361431$82E147DB-BD59-439A-890F-B7B46E326290","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"f174891c4bb64e0ae9ce793b71bcd4abd9034b6e","datavalue":{"value":{"time":"+2023-02-28T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q7361431$AFA1CAED-FA88-43E1-962B-FBDC6240888F","rank":"normal"}],"P43":[{"mainsnak":{"snaktype":"value","property":"P43","hash":"f94288ed91377510811411084214ae1d548d5352","datavalue":{"value":"Andrei Popescu","type":"string"},"datatype":"string"},"type":"statement","id":"Q7361431$1F04AC2C-CD9D-4155-B61B-C4CE6F53A0D3","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"3641fca310c299d4bd2b7f5cb0c7492d4d056136","datavalue":{"value":{"text":"Renaming-Enriched Sets (Rensets) and Renaming-Based Recursion","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q7361431$70440FEF-3E43-4973-84E2-17D247B1C501","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"71c13e9b8ed8409f16fb4b7467761bbb446606b8","datavalue":{"value":"I formalize the notion of renaming-enriched sets ( rensets for short) and renaming-based recursion introduced in my IJCAR 2022 paper \u201cRensets and Renaming-Based Recursion for Syntax with Bindings\u201d . Rensets are an algebraic axiomatization of renaming (variable-for-variable substitution). The formalization includes a connection with nominal sets, showing that any renset naturally gives rise to a nominal set. It also includes examples of deploying the renaming-based recursor: semantic interpretation, counting functions for free and bound occurrences, unary and parallel substitution, etc. Finally, it includes a variation of rensets that axiomatize term-for-variable substitution, called substitutive sets , which yields a corresponding recursion principle.","type":"string"},"datatype":"string"},"type":"statement","id":"Q7361431$0AC35999-0BBC-4E64-B5A6-BBD3CE523A85","rank":"normal"}],"P223":[{"mainsnak":{"snaktype":"value","property":"P223","hash":"3206ef335f348337cd719cb5cf9a81818aacc954","datavalue":{"value":{"entity-type":"item","numeric-id":2104549,"id":"Q2104549"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361431$CEA2A851-84A1-4BE1-8132-86E4C363E397","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"84afe353d96a988928bd5d41e96afba7e81d6980","datavalue":{"value":{"entity-type":"item","numeric-id":1600086,"id":"Q1600086"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361431$18F6F135-BDAE-4E6F-A085-C971A999B39A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"2d7c974da2fbdfbb494f4ddce13bd1f1e2231832","datavalue":{"value":{"entity-type":"item","numeric-id":2849600,"id":"Q2849600"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361431$F222ACE8-B2E4-482A-B731-F10BF8DA507A","rank":"normal"}],"P37":[{"mainsnak":{"snaktype":"value","property":"P37","hash":"9a21a8eebe97539644aa32b24dda137c12e751dc","datavalue":{"value":{"entity-type":"item","numeric-id":40327,"id":"Q40327"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361431$A18D2CF7-2FF3-476A-9EE3-C09CDC9A4866","rank":"normal"}],"P2651":[{"mainsnak":{"snaktype":"value","property":"P2651","hash":"aa8f6bd5a2b4440f838b34acf103bdf45fee4f56","datavalue":{"value":{"entity-type":"item","numeric-id":7360797,"id":"Q7360797"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361431$613A5193-025C-4807-B4AE-B01BEEFB3B70","rank":"normal"}],"P1460":[{"mainsnak":{"snaktype":"value","property":"P1460","hash":"908c3454b3659c4b140ccce33c5aee31081edc8d","datavalue":{"value":{"entity-type":"item","numeric-id":5976450,"id":"Q5976450"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361431$2E5D437E-0219-43E9-9CD3-650B55094401","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Renaming-Enriched Sets (Rensets) and Renaming-Based Recursion","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Renaming-Enriched_Sets_(Rensets)_and_Renaming-Based_Recursion"}}}}}