{"id":26950539,"url":"https://github.com/formulae-org/package-logic-js","last_synced_at":"2025-10-12T23:41:23.908Z","repository":{"id":187620637,"uuid":"627247316","full_name":"formulae-org/package-logic-js","owner":"formulae-org","description":"Logic package for Fōrmulæ, in JavaScript","archived":false,"fork":false,"pushed_at":"2025-03-21T04:20:49.000Z","size":72,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-04-02T23:32:10.335Z","etag":null,"topics":["conditional","conjunction","disjunction","equivalence","exclusive-disjunction","existential-quantifier","formulae","javascript","logic","negation","predicate-logic","predicates","universal-quantifiers"],"latest_commit_sha":null,"homepage":"","language":"JavaScript","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"agpl-3.0","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/formulae-org.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2023-04-13T04:38:50.000Z","updated_at":"2025-03-21T04:20:52.000Z","dependencies_parsed_at":"2025-01-11T06:20:03.160Z","dependency_job_id":"8a309135-83b6-419a-8d71-abdfe576dfd9","html_url":"https://github.com/formulae-org/package-logic-js","commit_stats":null,"previous_names":["formulae-org/package-logic-js"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/formulae-org/package-logic-js","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/formulae-org%2Fpackage-logic-js","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/formulae-org%2Fpackage-logic-js/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/formulae-org%2Fpackage-logic-js/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/formulae-org%2Fpackage-logic-js/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/formulae-org","download_url":"https://codeload.github.com/formulae-org/package-logic-js/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/formulae-org%2Fpackage-logic-js/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":279013412,"owners_count":26085274,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","status":"online","status_checked_at":"2025-10-12T02:00:06.719Z","response_time":53,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["conditional","conjunction","disjunction","equivalence","exclusive-disjunction","existential-quantifier","formulae","javascript","logic","negation","predicate-logic","predicates","universal-quantifiers"],"created_at":"2025-04-02T23:29:58.036Z","updated_at":"2025-10-12T23:41:23.891Z","avatar_url":"https://github.com/formulae-org.png","language":"JavaScript","funding_links":[],"categories":[],"sub_categories":[],"readme":"# package-logic-js\n\nComplex arithmetic package for the [Fōrmulæ](https://formulae.org) programming language.\n\nFōrmulæ is also a software framework for visualization, edition and manipulation of complex expressions, from many fields. The code for an specific field —i.e. arithmetics— is encapsulated in a single unit called a Fōrmulæ **package**.\n\nThis repository contains the source code for the **logic package**. It is intended to the computation of logical operations.\n\nThe GitHub organization [formulae-org](https://github.com/formulae-org) encompasses the source code for the rest of packages, as well as the [web application](https://github.com/formulae-org/formulae-js).\n\n\u003c!--\nTake a look at this [tutorial](https://formulae.org/?script=tutorials/Complex) to know the capabilities of the Fōrmulæ arithmetic package.\n--\u003e\n\n### Capabilities ###\n\n* Visualization of the [truth values](https://en.wikipedia.org/wiki/Truth_value) *true* and *false*\n* Visualization of logic operations. Users can choose between:\n\n\u003cdiv align=\"center\"\u003e\n   \n| Operation | Traditional notation | Mnemonic notation |\n| ----- |:-----:|:-----:|\n| [Negation](https://en.wikipedia.org/wiki/Negation)                  | $\\neg P$              | $\\text{NOT } P$    |\n| [Conjunction](https://en.wikipedia.org/wiki/Logical_conjunction)    | $P \\land Q$           | $P \\text{ AND } Q$ |\n| [Disjunction](https://en.wikipedia.org/wiki/Logical_disjunction)    | $P \\lor Q$            | $P \\text{ OR } Q$  |\n| [Conditional](https://en.wikipedia.org/wiki/Material_conditional)   | $P \\to Q$             | $P \\text{ IF } Q$  |\n| [Equivalence](https://en.wikipedia.org/wiki/Logical_biconditional)  | $P \\leftrightarrow Q$ | $P \\text{ IFF } Q$ |\n| [Exclusive disjunction](https://en.wikipedia.org/wiki/Exclusive_or) | $P \\oplus Q$          | $P \\text{ XOR } Q$ |\n\n\u003c/div\u003e\n\n* Visualization of [predicate](https://en.wikipedia.org/wiki/Predicate_(mathematical_logic)) expressions\n    * Nullary or 0-arity predicates, visualized as its own name, e.g. $P$\n    * [First order logic](https://en.wikipedia.org/wiki/First-order_logic) predicates, with a given number of [terms](https://en.wikipedia.org/wiki/Term_(logic)), visualized as $P(t_1, t_2, ..., t_n)$\n* Visualization of [universal quantifier](https://en.wikipedia.org/wiki/Universal_quantification), shown as $\\forall$\n* Visualization of [existential quantifier](https://en.wikipedia.org/wiki/Existential_quantification), shown as $\\exists$\n* Reduction of the logic operations [negation](https://en.wikipedia.org/wiki/Negation), [conjunction](https://en.wikipedia.org/wiki/Logical_conjunction), [disjunction](https://en.wikipedia.org/wiki/Logical_disjunction), [conditional](https://en.wikipedia.org/wiki/Material_conditional), [equivalence](https://en.wikipedia.org/wiki/Logical_biconditional) and [exclusive disjunction](https://en.wikipedia.org/wiki/Exclusive_or)\n* Conversion from/to numeric values (true ⇔ 1, false ⇔ 0)\n\n### Examples ###\n\nThe following Fōrmulæ scripts use expressions from the **logic package**:\n\n* [Truth table](https://formulae.org/?script=examples/Truth_table)\n\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fformulae-org%2Fpackage-logic-js","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fformulae-org%2Fpackage-logic-js","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fformulae-org%2Fpackage-logic-js/lists"}